./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.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 a340dc1e9a375ad2082e9c8cecf3a1a681edcfe0f7220085504fa1991ced3d70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:54:04,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:54:04,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:54:04,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:54:04,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:54:04,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:54:04,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:54:04,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:54:04,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:54:04,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:54:04,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:54:04,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:54:04,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:54:04,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:54:04,698 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:54:04,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:54:04,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:54:04,700 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:54:04,700 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:54:04,700 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:54:04,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:54:04,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:54:04,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:54:04,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:54:04,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:54:04,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:54:04,701 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:54:04,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:54:04,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:54:04,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:54:04,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:54:04,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:54:04,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:54:04,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:54:04,701 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 -> a340dc1e9a375ad2082e9c8cecf3a1a681edcfe0f7220085504fa1991ced3d70 [2025-03-04 10:54:04,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:54:04,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:54:04,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:54:04,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:54:04,912 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:54:04,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2025-03-04 10:54:05,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34728f8d1/e7761b8f53aa4c57bfb614e38d1e1f96/FLAG9b29963cc [2025-03-04 10:54:06,166 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:54:06,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2025-03-04 10:54:06,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34728f8d1/e7761b8f53aa4c57bfb614e38d1e1f96/FLAG9b29963cc [2025-03-04 10:54:06,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34728f8d1/e7761b8f53aa4c57bfb614e38d1e1f96 [2025-03-04 10:54:06,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:54:06,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:54:06,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:54:06,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:54:06,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:54:06,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6271610d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06, skipping insertion in model container [2025-03-04 10:54:06,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:54:06,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:54:06,343 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:54:06,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:54:06,369 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:54:06,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06 WrapperNode [2025-03-04 10:54:06,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:54:06,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:54:06,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:54:06,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:54:06,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,393 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2025-03-04 10:54:06,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:54:06,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:54:06,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:54:06,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:54:06,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,414 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-04 10:54:06,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:54:06,427 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:54:06,427 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:54:06,427 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:54:06,428 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (1/1) ... [2025-03-04 10:54:06,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:54:06,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:06,452 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:54:06,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:54:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:54:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:54:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:54:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:54:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:54:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:54:06,502 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:54:06,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:54:06,704 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-04 10:54:06,704 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:54:06,712 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:54:06,712 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:54:06,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:54:06 BoogieIcfgContainer [2025-03-04 10:54:06,712 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:54:06,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:54:06,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:54:06,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:54:06,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:54:06" (1/3) ... [2025-03-04 10:54:06,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20385f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:54:06, skipping insertion in model container [2025-03-04 10:54:06,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:54:06" (2/3) ... [2025-03-04 10:54:06,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20385f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:54:06, skipping insertion in model container [2025-03-04 10:54:06,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:54:06" (3/3) ... [2025-03-04 10:54:06,718 INFO L128 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound10.c [2025-03-04 10:54:06,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:54:06,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohendiv-ll_unwindbound10.c that has 2 procedures, 95 locations, 1 initial locations, 2 loop locations, and 34 error locations. [2025-03-04 10:54:06,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:54:06,777 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;@4ed89100, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:54:06,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-04 10:54:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 86 states have internal predecessors, (94), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 10:54:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:54:06,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:06,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:54:06,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:06,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:06,788 INFO L85 PathProgramCache]: Analyzing trace with hash -568468770, now seen corresponding path program 1 times [2025-03-04 10:54:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:06,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338713444] [2025-03-04 10:54:06,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:06,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:06,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:54:06,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:54:06,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:06,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:54:06,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:06,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338713444] [2025-03-04 10:54:06,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338713444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:06,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:06,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:54:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413746769] [2025-03-04 10:54:06,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:06,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:54:06,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:06,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:54:06,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:54:06,892 INFO L87 Difference]: Start difference. First operand has 95 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 86 states have internal predecessors, (94), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:54:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:06,907 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2025-03-04 10:54:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:54:06,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:54:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:06,912 INFO L225 Difference]: With dead ends: 186 [2025-03-04 10:54:06,912 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 10:54:06,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:54:06,915 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:06,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 10:54:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 10:54:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 80 states have internal predecessors, (84), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:54:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2025-03-04 10:54:06,939 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 6 [2025-03-04 10:54:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:06,940 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2025-03-04 10:54:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:54:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2025-03-04 10:54:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:54:06,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:06,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:54:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:54:06,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash -568438979, now seen corresponding path program 1 times [2025-03-04 10:54:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473390500] [2025-03-04 10:54:06,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:06,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:54:06,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:54:06,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:06,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:54:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473390500] [2025-03-04 10:54:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473390500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:06,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:06,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:54:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906663813] [2025-03-04 10:54:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:07,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:07,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:07,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:07,001 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:54:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:07,046 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2025-03-04 10:54:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:54:07,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:54:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:07,048 INFO L225 Difference]: With dead ends: 126 [2025-03-04 10:54:07,048 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 10:54:07,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:54:07,049 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 39 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:07,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 264 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 10:54:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2025-03-04 10:54:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.75) internal successors, (105), 94 states have internal predecessors, (105), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:54:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2025-03-04 10:54:07,056 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 6 [2025-03-04 10:54:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:07,056 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2025-03-04 10:54:07,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:54:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2025-03-04 10:54:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:54:07,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:07,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:07,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:54:07,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:07,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash -441739109, now seen corresponding path program 1 times [2025-03-04 10:54:07,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:07,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421382016] [2025-03-04 10:54:07,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:07,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:54:07,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:54:07,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:07,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:54:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421382016] [2025-03-04 10:54:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421382016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:07,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:07,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:54:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498283597] [2025-03-04 10:54:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:07,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:07,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:07,114 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:54:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:07,147 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2025-03-04 10:54:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:54:07,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:54:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:07,153 INFO L225 Difference]: With dead ends: 113 [2025-03-04 10:54:07,153 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 10:54:07,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:54:07,154 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:07,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 267 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 10:54:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 10:54:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 94 states have internal predecessors, (103), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:54:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2025-03-04 10:54:07,163 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 7 [2025-03-04 10:54:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:07,163 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2025-03-04 10:54:07,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:54:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2025-03-04 10:54:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:54:07,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:07,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:07,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:54:07,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash 690480281, now seen corresponding path program 1 times [2025-03-04 10:54:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:07,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306225107] [2025-03-04 10:54:07,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:07,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:07,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:54:07,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:54:07,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:07,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947882478] [2025-03-04 10:54:07,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:07,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:07,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:07,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:07,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:54:07,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:54:07,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:54:07,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:07,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:07,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:54:07,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:54:07,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:07,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306225107] [2025-03-04 10:54:07,232 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947882478] [2025-03-04 10:54:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947882478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:07,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:07,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:54:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447769260] [2025-03-04 10:54:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:07,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:54:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:07,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:54:07,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:54:07,233 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:54:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:07,277 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2025-03-04 10:54:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:54:07,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 10:54:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:07,278 INFO L225 Difference]: With dead ends: 119 [2025-03-04 10:54:07,278 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 10:54:07,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:54:07,279 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 18 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:07,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:07,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 10:54:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2025-03-04 10:54:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 94 states have internal predecessors, (101), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:54:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2025-03-04 10:54:07,284 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 9 [2025-03-04 10:54:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:07,284 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2025-03-04 10:54:07,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:54:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2025-03-04 10:54:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:54:07,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:07,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:07,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:07,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:07,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash 441697477, now seen corresponding path program 1 times [2025-03-04 10:54:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:07,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081398724] [2025-03-04 10:54:07,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:07,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:07,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:54:07,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:54:07,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:07,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1453657844] [2025-03-04 10:54:07,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:07,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:07,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:07,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:07,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:54:07,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:54:07,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:54:07,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:07,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:07,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:54:07,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:54:07,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:07,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:07,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081398724] [2025-03-04 10:54:07,575 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:07,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453657844] [2025-03-04 10:54:07,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453657844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:07,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:07,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:54:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329917842] [2025-03-04 10:54:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:07,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:54:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:07,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:54:07,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:54:07,576 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:54:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:07,641 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2025-03-04 10:54:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:54:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 10:54:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:07,642 INFO L225 Difference]: With dead ends: 160 [2025-03-04 10:54:07,642 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 10:54:07,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:54:07,643 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 51 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:07,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 142 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 10:54:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2025-03-04 10:54:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 117 states have internal predecessors, (142), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:54:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2025-03-04 10:54:07,650 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 16 [2025-03-04 10:54:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:07,650 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2025-03-04 10:54:07,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:54:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2025-03-04 10:54:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:54:07,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:07,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:07,660 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-04 10:54:07,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:07,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:07,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash -730485469, now seen corresponding path program 1 times [2025-03-04 10:54:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:07,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357395993] [2025-03-04 10:54:07,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:07,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:54:07,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:54:07,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:07,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:07,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478136988] [2025-03-04 10:54:07,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:07,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:07,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:07,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:07,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:54:07,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:54:07,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:54:07,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:07,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:07,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:54:07,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:54:07,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357395993] [2025-03-04 10:54:07,963 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478136988] [2025-03-04 10:54:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478136988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:07,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:07,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006387967] [2025-03-04 10:54:07,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:07,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:07,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:07,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:07,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:07,964 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:54:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:08,083 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2025-03-04 10:54:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:54:08,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 10:54:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:08,084 INFO L225 Difference]: With dead ends: 153 [2025-03-04 10:54:08,084 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 10:54:08,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:54:08,085 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 182 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:08,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 142 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 10:54:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2025-03-04 10:54:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 85 states have (on average 1.6588235294117648) internal successors, (141), 118 states have internal predecessors, (141), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:54:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2025-03-04 10:54:08,099 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 18 [2025-03-04 10:54:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:08,100 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2025-03-04 10:54:08,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:54:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2025-03-04 10:54:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 10:54:08,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:08,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:08,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:54:08,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:08,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:08,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1170213018, now seen corresponding path program 1 times [2025-03-04 10:54:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:08,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998053927] [2025-03-04 10:54:08,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:08,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:54:08,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:54:08,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:08,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:08,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087472763] [2025-03-04 10:54:08,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:08,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:08,314 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:08,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:54:08,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:54:08,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:54:08,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:08,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:08,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:54:08,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:54:08,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:08,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998053927] [2025-03-04 10:54:08,400 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087472763] [2025-03-04 10:54:08,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087472763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:08,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:08,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:08,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911264588] [2025-03-04 10:54:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:08,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:08,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:08,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:08,401 INFO L87 Difference]: Start difference. First operand 133 states and 165 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:54:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:08,482 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2025-03-04 10:54:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:54:08,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-04 10:54:08,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:08,486 INFO L225 Difference]: With dead ends: 153 [2025-03-04 10:54:08,486 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 10:54:08,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:54:08,487 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 178 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:08,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 145 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 10:54:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2025-03-04 10:54:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.646341463414634) internal successors, (135), 115 states have internal predecessors, (135), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:54:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2025-03-04 10:54:08,502 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 19 [2025-03-04 10:54:08,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:08,502 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2025-03-04 10:54:08,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:54:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2025-03-04 10:54:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:54:08,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:08,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:08,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:54:08,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:08,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:08,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1718315284, now seen corresponding path program 1 times [2025-03-04 10:54:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:08,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655156776] [2025-03-04 10:54:08,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:08,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:54:08,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:54:08,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:08,788 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-04 10:54:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655156776] [2025-03-04 10:54:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655156776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:08,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:54:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815331919] [2025-03-04 10:54:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:08,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:54:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:08,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:54:08,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:54:08,789 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:54:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:08,858 INFO L93 Difference]: Finished difference Result 130 states and 159 transitions. [2025-03-04 10:54:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:54:08,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-04 10:54:08,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:08,859 INFO L225 Difference]: With dead ends: 130 [2025-03-04 10:54:08,859 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 10:54:08,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:54:08,860 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 149 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:08,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 247 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:08,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 10:54:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-03-04 10:54:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.6097560975609757) internal successors, (132), 113 states have internal predecessors, (132), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:54:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2025-03-04 10:54:08,867 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 27 [2025-03-04 10:54:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:08,867 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2025-03-04 10:54:08,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:54:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2025-03-04 10:54:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:54:08,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:08,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:08,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:54:08,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:08,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1728166222, now seen corresponding path program 1 times [2025-03-04 10:54:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:08,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103875832] [2025-03-04 10:54:08,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:08,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:08,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:54:08,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:54:08,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:08,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:08,948 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-04 10:54:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103875832] [2025-03-04 10:54:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103875832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:08,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:08,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:54:08,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598225637] [2025-03-04 10:54:08,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:08,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:54:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:08,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:54:08,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:54:08,950 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:54:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:08,997 INFO L93 Difference]: Finished difference Result 214 states and 252 transitions. [2025-03-04 10:54:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:54:08,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 10:54:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:08,998 INFO L225 Difference]: With dead ends: 214 [2025-03-04 10:54:08,998 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 10:54:08,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:54:08,999 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 13 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:08,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 347 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 10:54:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-04 10:54:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 117 states have internal predecessors, (136), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:54:09,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2025-03-04 10:54:09,009 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 28 [2025-03-04 10:54:09,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:09,009 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2025-03-04 10:54:09,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:54:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2025-03-04 10:54:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:54:09,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:09,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:54:09,011 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1384605104, now seen corresponding path program 1 times [2025-03-04 10:54:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244488523] [2025-03-04 10:54:09,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:09,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:54:09,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:54:09,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:09,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:09,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998936253] [2025-03-04 10:54:09,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:09,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:09,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:09,029 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:09,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:54:09,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:54:09,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:54:09,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:09,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:09,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:54:09,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:09,109 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-04 10:54:09,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:09,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:09,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244488523] [2025-03-04 10:54:09,109 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:09,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998936253] [2025-03-04 10:54:09,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998936253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:09,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:09,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429705544] [2025-03-04 10:54:09,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:09,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:09,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:09,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:09,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:09,110 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:54:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:09,245 INFO L93 Difference]: Finished difference Result 206 states and 277 transitions. [2025-03-04 10:54:09,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:54:09,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-04 10:54:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:09,246 INFO L225 Difference]: With dead ends: 206 [2025-03-04 10:54:09,246 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 10:54:09,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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-04 10:54:09,247 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 117 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:09,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 96 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 10:54:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2025-03-04 10:54:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 129 states have (on average 1.5891472868217054) internal successors, (205), 160 states have internal predecessors, (205), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:54:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 245 transitions. [2025-03-04 10:54:09,261 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 245 transitions. Word has length 30 [2025-03-04 10:54:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:09,261 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 245 transitions. [2025-03-04 10:54:09,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:54:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 245 transitions. [2025-03-04 10:54:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:54:09,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:09,261 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:09,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:54:09,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 10:54:09,466 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:09,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:09,466 INFO L85 PathProgramCache]: Analyzing trace with hash -26914712, now seen corresponding path program 1 times [2025-03-04 10:54:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:09,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80174047] [2025-03-04 10:54:09,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:09,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:09,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:54:09,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:54:09,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:09,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112592135] [2025-03-04 10:54:09,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:09,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:09,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:09,485 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:09,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:54:09,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:54:09,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:54:09,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:09,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:09,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:54:09,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:09,559 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-04 10:54:09,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:09,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80174047] [2025-03-04 10:54:09,559 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:09,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112592135] [2025-03-04 10:54:09,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112592135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:09,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:09,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163744047] [2025-03-04 10:54:09,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:09,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:09,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:09,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:09,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:09,560 INFO L87 Difference]: Start difference. First operand 183 states and 245 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:54:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:09,658 INFO L93 Difference]: Finished difference Result 204 states and 268 transitions. [2025-03-04 10:54:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:54:09,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-04 10:54:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:09,660 INFO L225 Difference]: With dead ends: 204 [2025-03-04 10:54:09,660 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 10:54:09,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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-04 10:54:09,661 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 115 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:09,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 96 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 10:54:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 184. [2025-03-04 10:54:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 130 states have (on average 1.5538461538461539) internal successors, (202), 161 states have internal predecessors, (202), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:54:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 242 transitions. [2025-03-04 10:54:09,673 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 242 transitions. Word has length 31 [2025-03-04 10:54:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:09,673 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 242 transitions. [2025-03-04 10:54:09,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:54:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 242 transitions. [2025-03-04 10:54:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 10:54:09,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:09,674 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 10:54:09,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:09,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:09,875 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:09,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash 580974272, now seen corresponding path program 1 times [2025-03-04 10:54:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:09,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987067729] [2025-03-04 10:54:09,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:09,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:54:09,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:54:09,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:09,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:09,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:09,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987067729] [2025-03-04 10:54:09,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987067729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:09,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:09,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366695325] [2025-03-04 10:54:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:09,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:09,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:09,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:09,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:09,952 INFO L87 Difference]: Start difference. First operand 184 states and 242 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-04 10:54:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:10,071 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2025-03-04 10:54:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:54:10,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 51 [2025-03-04 10:54:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:10,072 INFO L225 Difference]: With dead ends: 219 [2025-03-04 10:54:10,072 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 10:54:10,073 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-04 10:54:10,073 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 133 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:10,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 10:54:10,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 186. [2025-03-04 10:54:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 163 states have internal predecessors, (202), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:54:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2025-03-04 10:54:10,085 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 51 [2025-03-04 10:54:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:10,085 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2025-03-04 10:54:10,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-04 10:54:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2025-03-04 10:54:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 10:54:10,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:10,086 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 10:54:10,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:54:10,086 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:10,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:10,086 INFO L85 PathProgramCache]: Analyzing trace with hash 830333257, now seen corresponding path program 1 times [2025-03-04 10:54:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:10,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784664334] [2025-03-04 10:54:10,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:10,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 10:54:10,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 10:54:10,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:10,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:10,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:10,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784664334] [2025-03-04 10:54:10,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784664334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:10,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:10,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:10,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380342277] [2025-03-04 10:54:10,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:10,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:10,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:10,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:10,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:10,150 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-04 10:54:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:10,262 INFO L93 Difference]: Finished difference Result 219 states and 267 transitions. [2025-03-04 10:54:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:54:10,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 52 [2025-03-04 10:54:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:10,264 INFO L225 Difference]: With dead ends: 219 [2025-03-04 10:54:10,264 INFO L226 Difference]: Without dead ends: 217 [2025-03-04 10:54:10,264 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-04 10:54:10,264 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 130 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:10,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 92 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-04 10:54:10,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 188. [2025-03-04 10:54:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 134 states have (on average 1.507462686567164) internal successors, (202), 165 states have internal predecessors, (202), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:54:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2025-03-04 10:54:10,272 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 52 [2025-03-04 10:54:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:10,272 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2025-03-04 10:54:10,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-04 10:54:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2025-03-04 10:54:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:54:10,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:10,273 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 10:54:10,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:54:10,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:10,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash -913656874, now seen corresponding path program 1 times [2025-03-04 10:54:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609021560] [2025-03-04 10:54:10,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:10,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:54:10,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:54:10,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:10,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:10,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:10,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609021560] [2025-03-04 10:54:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609021560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:10,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:10,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:54:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425894402] [2025-03-04 10:54:10,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:10,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:54:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:10,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:54:10,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:54:10,305 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-04 10:54:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:10,340 INFO L93 Difference]: Finished difference Result 194 states and 242 transitions. [2025-03-04 10:54:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:54:10,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 54 [2025-03-04 10:54:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:10,341 INFO L225 Difference]: With dead ends: 194 [2025-03-04 10:54:10,341 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 10:54:10,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:54:10,342 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 15 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:10,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 148 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 10:54:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2025-03-04 10:54:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 134 states have (on average 1.5) internal successors, (201), 165 states have internal predecessors, (201), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:54:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 241 transitions. [2025-03-04 10:54:10,349 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 241 transitions. Word has length 54 [2025-03-04 10:54:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:10,350 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 241 transitions. [2025-03-04 10:54:10,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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-04 10:54:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 241 transitions. [2025-03-04 10:54:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 10:54:10,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:10,351 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 10:54:10,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:54:10,351 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:10,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash -913656826, now seen corresponding path program 1 times [2025-03-04 10:54:10,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:10,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89464111] [2025-03-04 10:54:10,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:10,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:10,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:54:10,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:54:10,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:10,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:10,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89464111] [2025-03-04 10:54:10,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89464111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:10,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:10,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:10,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795160254] [2025-03-04 10:54:10,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:10,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:10,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:10,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:10,426 INFO L87 Difference]: Start difference. First operand 188 states and 241 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:54:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:10,473 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2025-03-04 10:54:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:54:10,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2025-03-04 10:54:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:10,474 INFO L225 Difference]: With dead ends: 188 [2025-03-04 10:54:10,474 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 10:54:10,475 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-04 10:54:10,475 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 62 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:10,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 62 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:10,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 10:54:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-03-04 10:54:10,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 134 states have (on average 1.4701492537313432) internal successors, (197), 164 states have internal predecessors, (197), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:54:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2025-03-04 10:54:10,483 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 54 [2025-03-04 10:54:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:10,484 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2025-03-04 10:54:10,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:54:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2025-03-04 10:54:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:54:10,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:10,484 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 10:54:10,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:54:10,485 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:10,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1741407964, now seen corresponding path program 1 times [2025-03-04 10:54:10,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229546362] [2025-03-04 10:54:10,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:10,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:54:10,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:54:10,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:10,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:10,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:10,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229546362] [2025-03-04 10:54:10,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229546362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:10,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:10,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:54:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095113773] [2025-03-04 10:54:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:10,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:54:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:10,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:54:10,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:54:10,535 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:54:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:10,621 INFO L93 Difference]: Finished difference Result 296 states and 382 transitions. [2025-03-04 10:54:10,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:54:10,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2025-03-04 10:54:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:10,623 INFO L225 Difference]: With dead ends: 296 [2025-03-04 10:54:10,623 INFO L226 Difference]: Without dead ends: 295 [2025-03-04 10:54:10,623 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-04 10:54:10,624 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 192 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:10,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 217 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-04 10:54:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 264. [2025-03-04 10:54:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 201 states have (on average 1.5223880597014925) internal successors, (306), 231 states have internal predecessors, (306), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 10:54:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 366 transitions. [2025-03-04 10:54:10,637 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 366 transitions. Word has length 55 [2025-03-04 10:54:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:10,637 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 366 transitions. [2025-03-04 10:54:10,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:54:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 366 transitions. [2025-03-04 10:54:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:54:10,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:10,638 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 10:54:10,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:54:10,639 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:10,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1741409469, now seen corresponding path program 1 times [2025-03-04 10:54:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671855588] [2025-03-04 10:54:10,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:10,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 10:54:10,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 10:54:10,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:10,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:10,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671855588] [2025-03-04 10:54:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671855588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:10,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:10,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:54:10,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562951290] [2025-03-04 10:54:10,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:10,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:54:10,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:10,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:54:10,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:54:10,718 INFO L87 Difference]: Start difference. First operand 264 states and 366 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-04 10:54:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:11,033 INFO L93 Difference]: Finished difference Result 371 states and 511 transitions. [2025-03-04 10:54:11,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:54:11,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 55 [2025-03-04 10:54:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:11,035 INFO L225 Difference]: With dead ends: 371 [2025-03-04 10:54:11,035 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 10:54:11,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:54:11,036 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 316 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:11,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 278 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 10:54:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 334. [2025-03-04 10:54:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 261 states have (on average 1.5134099616858236) internal successors, (395), 291 states have internal predecessors, (395), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:54:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 475 transitions. [2025-03-04 10:54:11,053 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 475 transitions. Word has length 55 [2025-03-04 10:54:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:11,053 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 475 transitions. [2025-03-04 10:54:11,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-04 10:54:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 475 transitions. [2025-03-04 10:54:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:54:11,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:11,054 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 10:54:11,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:54:11,054 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:11,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1850927980, now seen corresponding path program 1 times [2025-03-04 10:54:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:11,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778100122] [2025-03-04 10:54:11,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:11,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:54:11,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:54:11,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:11,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:11,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:11,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778100122] [2025-03-04 10:54:11,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778100122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:11,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:11,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:11,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550198090] [2025-03-04 10:54:11,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:11,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:11,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:11,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:11,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:11,099 INFO L87 Difference]: Start difference. First operand 334 states and 475 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-04 10:54:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:11,247 INFO L93 Difference]: Finished difference Result 361 states and 496 transitions. [2025-03-04 10:54:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:54:11,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 56 [2025-03-04 10:54:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:11,249 INFO L225 Difference]: With dead ends: 361 [2025-03-04 10:54:11,250 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 10:54:11,250 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-04 10:54:11,250 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 47 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:11,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 10:54:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 338. [2025-03-04 10:54:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 265 states have (on average 1.5056603773584907) internal successors, (399), 295 states have internal predecessors, (399), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:54:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 479 transitions. [2025-03-04 10:54:11,265 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 479 transitions. Word has length 56 [2025-03-04 10:54:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:11,265 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 479 transitions. [2025-03-04 10:54:11,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-04 10:54:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 479 transitions. [2025-03-04 10:54:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 10:54:11,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:11,266 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:11,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:54:11,266 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash 354509920, now seen corresponding path program 1 times [2025-03-04 10:54:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254351337] [2025-03-04 10:54:11,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:11,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:54:11,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:54:11,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:11,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:11,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254351337] [2025-03-04 10:54:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254351337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271566853] [2025-03-04 10:54:11,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:11,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:11,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:11,348 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:11,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:54:11,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 10:54:11,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 10:54:11,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:11,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:11,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:54:11,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:54:11,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:11,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271566853] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:11,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:11,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 17 [2025-03-04 10:54:11,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012257176] [2025-03-04 10:54:11,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:11,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:54:11,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:11,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:54:11,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:54:11,584 INFO L87 Difference]: Start difference. First operand 338 states and 479 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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-04 10:54:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:11,686 INFO L93 Difference]: Finished difference Result 373 states and 504 transitions. [2025-03-04 10:54:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:54:11,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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 60 [2025-03-04 10:54:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:11,688 INFO L225 Difference]: With dead ends: 373 [2025-03-04 10:54:11,688 INFO L226 Difference]: Without dead ends: 371 [2025-03-04 10:54:11,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:54:11,688 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 110 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:11,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 394 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-04 10:54:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 346. [2025-03-04 10:54:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.4649446494464944) internal successors, (397), 301 states have internal predecessors, (397), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:54:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 477 transitions. [2025-03-04 10:54:11,714 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 477 transitions. Word has length 60 [2025-03-04 10:54:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:11,714 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 477 transitions. [2025-03-04 10:54:11,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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-04 10:54:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 477 transitions. [2025-03-04 10:54:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 10:54:11,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:11,715 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:11,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:11,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:11,916 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:11,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1381618421, now seen corresponding path program 1 times [2025-03-04 10:54:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:11,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569891619] [2025-03-04 10:54:11,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:11,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:11,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:54:11,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:54:11,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:11,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:11,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569891619] [2025-03-04 10:54:11,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569891619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:11,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276653439] [2025-03-04 10:54:11,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:11,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:11,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:11,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:54:11,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 10:54:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 10:54:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:12,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:54:12,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:54:12,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:54:12,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276653439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:12,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:12,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-03-04 10:54:12,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774926150] [2025-03-04 10:54:12,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:12,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:54:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:12,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:54:12,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:54:12,191 INFO L87 Difference]: Start difference. First operand 346 states and 477 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 10:54:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:12,340 INFO L93 Difference]: Finished difference Result 637 states and 826 transitions. [2025-03-04 10:54:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:54:12,341 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 62 [2025-03-04 10:54:12,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:12,342 INFO L225 Difference]: With dead ends: 637 [2025-03-04 10:54:12,342 INFO L226 Difference]: Without dead ends: 478 [2025-03-04 10:54:12,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:54:12,343 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 128 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:12,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 565 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:12,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-04 10:54:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 433. [2025-03-04 10:54:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 344 states have (on average 1.433139534883721) internal successors, (493), 376 states have internal predecessors, (493), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 10:54:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 593 transitions. [2025-03-04 10:54:12,364 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 593 transitions. Word has length 62 [2025-03-04 10:54:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 593 transitions. [2025-03-04 10:54:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-04 10:54:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 593 transitions. [2025-03-04 10:54:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 10:54:12,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:12,366 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:12,371 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-04 10:54:12,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:12,566 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:12,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1212782944, now seen corresponding path program 1 times [2025-03-04 10:54:12,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:12,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273947920] [2025-03-04 10:54:12,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:12,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:12,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:54:12,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:54:12,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:12,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:12,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038445805] [2025-03-04 10:54:12,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:12,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:12,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:12,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:12,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:54:12,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:54:12,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:54:12,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:12,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:12,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:54:12,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:54:12,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:12,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273947920] [2025-03-04 10:54:12,841 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038445805] [2025-03-04 10:54:12,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038445805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:12,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:12,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:54:12,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10913290] [2025-03-04 10:54:12,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:12,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:54:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:12,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:54:12,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:54:12,842 INFO L87 Difference]: Start difference. First operand 433 states and 593 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:13,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:13,198 INFO L93 Difference]: Finished difference Result 626 states and 867 transitions. [2025-03-04 10:54:13,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:54:13,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2025-03-04 10:54:13,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:13,201 INFO L225 Difference]: With dead ends: 626 [2025-03-04 10:54:13,201 INFO L226 Difference]: Without dead ends: 617 [2025-03-04 10:54:13,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:13,201 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 274 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:13,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 233 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-04 10:54:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 588. [2025-03-04 10:54:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 479 states have (on average 1.407098121085595) internal successors, (674), 511 states have internal predecessors, (674), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 10:54:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 814 transitions. [2025-03-04 10:54:13,225 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 814 transitions. Word has length 69 [2025-03-04 10:54:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:13,225 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 814 transitions. [2025-03-04 10:54:13,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 814 transitions. [2025-03-04 10:54:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:54:13,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:13,226 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:13,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:13,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:13,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:13,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:13,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1058434445, now seen corresponding path program 1 times [2025-03-04 10:54:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:13,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68309433] [2025-03-04 10:54:13,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:13,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:13,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:54:13,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:54:13,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:13,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:13,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122718457] [2025-03-04 10:54:13,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:13,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:13,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:13,439 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:13,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:54:13,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:54:13,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:54:13,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:13,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:13,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:54:13,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:54:13,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68309433] [2025-03-04 10:54:13,950 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122718457] [2025-03-04 10:54:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122718457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:13,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:13,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:54:13,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182810438] [2025-03-04 10:54:13,951 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:54:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:13,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:54:13,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:13,952 INFO L87 Difference]: Start difference. First operand 588 states and 814 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:14,219 INFO L93 Difference]: Finished difference Result 657 states and 894 transitions. [2025-03-04 10:54:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:54:14,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2025-03-04 10:54:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:14,222 INFO L225 Difference]: With dead ends: 657 [2025-03-04 10:54:14,222 INFO L226 Difference]: Without dead ends: 654 [2025-03-04 10:54:14,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:54:14,226 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 186 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:14,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 272 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-04 10:54:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 619. [2025-03-04 10:54:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 506 states have (on average 1.4051383399209487) internal successors, (711), 537 states have internal predecessors, (711), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-04 10:54:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 859 transitions. [2025-03-04 10:54:14,258 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 859 transitions. Word has length 70 [2025-03-04 10:54:14,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:14,258 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 859 transitions. [2025-03-04 10:54:14,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:14,259 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 859 transitions. [2025-03-04 10:54:14,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 10:54:14,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:14,259 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:14,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:54:14,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:54:14,460 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:14,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1548270530, now seen corresponding path program 1 times [2025-03-04 10:54:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:14,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005873616] [2025-03-04 10:54:14,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:14,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:14,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 10:54:14,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 10:54:14,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:14,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:54:14,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005873616] [2025-03-04 10:54:14,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005873616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:14,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:54:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422023073] [2025-03-04 10:54:14,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:14,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:54:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:14,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:54:14,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:54:14,523 INFO L87 Difference]: Start difference. First operand 619 states and 859 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:14,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:14,845 INFO L93 Difference]: Finished difference Result 893 states and 1263 transitions. [2025-03-04 10:54:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:54:14,846 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), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2025-03-04 10:54:14,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:14,849 INFO L225 Difference]: With dead ends: 893 [2025-03-04 10:54:14,850 INFO L226 Difference]: Without dead ends: 890 [2025-03-04 10:54:14,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:54:14,851 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 148 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:14,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 244 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-03-04 10:54:14,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 638. [2025-03-04 10:54:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 522 states have (on average 1.3888888888888888) internal successors, (725), 552 states have internal predecessors, (725), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 10:54:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 881 transitions. [2025-03-04 10:54:14,896 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 881 transitions. Word has length 71 [2025-03-04 10:54:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:14,896 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 881 transitions. [2025-03-04 10:54:14,896 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), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 881 transitions. [2025-03-04 10:54:14,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 10:54:14,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:14,897 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:14,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:54:14,897 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:14,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1586841554, now seen corresponding path program 1 times [2025-03-04 10:54:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:14,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460913987] [2025-03-04 10:54:14,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:14,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:14,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 10:54:14,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 10:54:14,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:14,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066339063] [2025-03-04 10:54:14,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:14,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:14,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:14,908 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:14,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:54:14,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 10:54:14,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 10:54:14,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:14,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:14,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:54:14,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:54:15,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:15,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:15,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460913987] [2025-03-04 10:54:15,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:15,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066339063] [2025-03-04 10:54:15,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066339063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:15,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:15,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:54:15,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785489848] [2025-03-04 10:54:15,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:15,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:54:15,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:15,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:54:15,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:54:15,081 INFO L87 Difference]: Start difference. First operand 638 states and 881 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:15,308 INFO L93 Difference]: Finished difference Result 661 states and 917 transitions. [2025-03-04 10:54:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:54:15,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 71 [2025-03-04 10:54:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:15,311 INFO L225 Difference]: With dead ends: 661 [2025-03-04 10:54:15,311 INFO L226 Difference]: Without dead ends: 657 [2025-03-04 10:54:15,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 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-04 10:54:15,312 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 134 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:15,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 214 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-04 10:54:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 634. [2025-03-04 10:54:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 522 states have (on average 1.3639846743295019) internal successors, (712), 548 states have internal predecessors, (712), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 10:54:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 868 transitions. [2025-03-04 10:54:15,341 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 868 transitions. Word has length 71 [2025-03-04 10:54:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:15,341 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 868 transitions. [2025-03-04 10:54:15,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:15,341 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 868 transitions. [2025-03-04 10:54:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:54:15,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:15,342 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:15,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:54:15,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 10:54:15,542 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:15,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash -751746133, now seen corresponding path program 1 times [2025-03-04 10:54:15,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:15,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817158873] [2025-03-04 10:54:15,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:15,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:54:15,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:54:15,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:15,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:15,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528269528] [2025-03-04 10:54:15,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:15,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:15,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:15,558 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:15,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:54:15,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:54:15,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:54:15,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:15,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:15,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:54:15,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:54:15,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:19,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817158873] [2025-03-04 10:54:19,901 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:19,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528269528] [2025-03-04 10:54:19,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528269528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:19,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:19,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:54:19,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443140496] [2025-03-04 10:54:19,901 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:19,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:54:19,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:19,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:54:19,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2025-03-04 10:54:19,902 INFO L87 Difference]: Start difference. First operand 634 states and 868 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:20,216 INFO L93 Difference]: Finished difference Result 661 states and 884 transitions. [2025-03-04 10:54:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:54:20,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2025-03-04 10:54:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:20,218 INFO L225 Difference]: With dead ends: 661 [2025-03-04 10:54:20,218 INFO L226 Difference]: Without dead ends: 654 [2025-03-04 10:54:20,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=52, Invalid=157, Unknown=1, NotChecked=0, Total=210 [2025-03-04 10:54:20,219 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 270 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:20,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 245 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-04 10:54:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 632. [2025-03-04 10:54:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 520 states have (on average 1.3576923076923078) internal successors, (706), 546 states have internal predecessors, (706), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 10:54:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 862 transitions. [2025-03-04 10:54:20,246 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 862 transitions. Word has length 72 [2025-03-04 10:54:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:20,247 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 862 transitions. [2025-03-04 10:54:20,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 862 transitions. [2025-03-04 10:54:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:54:20,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:20,248 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:20,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 10:54:20,448 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1947447894, now seen corresponding path program 1 times [2025-03-04 10:54:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930001655] [2025-03-04 10:54:20,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:20,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:54:20,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:54:20,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:20,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:20,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333758037] [2025-03-04 10:54:20,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:20,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:20,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:20,463 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:20,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:54:20,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:54:20,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:54:20,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:20,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:20,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:54:20,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:54:20,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:20,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:20,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930001655] [2025-03-04 10:54:20,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:20,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333758037] [2025-03-04 10:54:20,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333758037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:20,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:20,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:54:20,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037449346] [2025-03-04 10:54:20,762 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:20,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:54:20,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:20,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:54:20,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:54:20,762 INFO L87 Difference]: Start difference. First operand 632 states and 862 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:21,029 INFO L93 Difference]: Finished difference Result 1000 states and 1424 transitions. [2025-03-04 10:54:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:54:21,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2025-03-04 10:54:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:21,032 INFO L225 Difference]: With dead ends: 1000 [2025-03-04 10:54:21,032 INFO L226 Difference]: Without dead ends: 996 [2025-03-04 10:54:21,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:54:21,033 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 154 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:21,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 302 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-04 10:54:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 789. [2025-03-04 10:54:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 657 states have (on average 1.3637747336377473) internal successors, (896), 682 states have internal predecessors, (896), 98 states have call successors, (98), 8 states have call predecessors, (98), 8 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 10:54:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1092 transitions. [2025-03-04 10:54:21,070 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1092 transitions. Word has length 72 [2025-03-04 10:54:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1092 transitions. [2025-03-04 10:54:21,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 10:54:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1092 transitions. [2025-03-04 10:54:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:54:21,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:21,071 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:21,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:21,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:54:21,276 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:21,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash 456572674, now seen corresponding path program 1 times [2025-03-04 10:54:21,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:21,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75364116] [2025-03-04 10:54:21,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:21,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:21,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 10:54:21,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:54:21,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:21,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75364116] [2025-03-04 10:54:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75364116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:21,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603309089] [2025-03-04 10:54:21,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:21,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:21,336 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:21,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:54:21,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 10:54:21,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:54:21,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:21,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:21,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:54:21,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:21,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:21,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603309089] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:21,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:21,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 10:54:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531435895] [2025-03-04 10:54:21,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:21,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:54:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:21,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:54:21,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:54:21,522 INFO L87 Difference]: Start difference. First operand 789 states and 1092 transitions. Second operand has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 8 states have internal predecessors, (83), 7 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 10:54:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:22,007 INFO L93 Difference]: Finished difference Result 1321 states and 1885 transitions. [2025-03-04 10:54:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:54:22,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 8 states have internal predecessors, (83), 7 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 92 [2025-03-04 10:54:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:22,011 INFO L225 Difference]: With dead ends: 1321 [2025-03-04 10:54:22,011 INFO L226 Difference]: Without dead ends: 1319 [2025-03-04 10:54:22,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:22,012 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 275 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:22,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 395 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:54:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-03-04 10:54:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1034. [2025-03-04 10:54:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 861 states have (on average 1.3704994192799071) internal successors, (1180), 885 states have internal predecessors, (1180), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 10:54:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1460 transitions. [2025-03-04 10:54:22,069 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1460 transitions. Word has length 92 [2025-03-04 10:54:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:22,069 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1460 transitions. [2025-03-04 10:54:22,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 8 states have internal predecessors, (83), 7 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-04 10:54:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1460 transitions. [2025-03-04 10:54:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 10:54:22,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:22,070 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:22,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:22,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:22,274 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:22,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1268851015, now seen corresponding path program 1 times [2025-03-04 10:54:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427888833] [2025-03-04 10:54:22,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:22,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 10:54:22,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 10:54:22,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:22,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:22,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427888833] [2025-03-04 10:54:22,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427888833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560641593] [2025-03-04 10:54:22,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:22,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:22,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:22,333 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:22,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:54:22,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 10:54:22,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 10:54:22,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:22,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:22,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:54:22,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:22,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560641593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:22,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:22,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-03-04 10:54:22,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157426610] [2025-03-04 10:54:22,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:22,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:54:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:22,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:54:22,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:54:22,534 INFO L87 Difference]: Start difference. First operand 1034 states and 1460 transitions. Second operand has 11 states, 10 states have (on average 12.7) internal successors, (127), 11 states have internal predecessors, (127), 9 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2025-03-04 10:54:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:23,114 INFO L93 Difference]: Finished difference Result 1351 states and 1892 transitions. [2025-03-04 10:54:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:54:23,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.7) internal successors, (127), 11 states have internal predecessors, (127), 9 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) Word has length 93 [2025-03-04 10:54:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:23,118 INFO L225 Difference]: With dead ends: 1351 [2025-03-04 10:54:23,118 INFO L226 Difference]: Without dead ends: 1349 [2025-03-04 10:54:23,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:54:23,118 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 864 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:23,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 440 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:54:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2025-03-04 10:54:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1038. [2025-03-04 10:54:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 866 states have (on average 1.3325635103926097) internal successors, (1154), 889 states have internal predecessors, (1154), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 10:54:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1434 transitions. [2025-03-04 10:54:23,181 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1434 transitions. Word has length 93 [2025-03-04 10:54:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:23,181 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1434 transitions. [2025-03-04 10:54:23,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.7) internal successors, (127), 11 states have internal predecessors, (127), 9 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 9 states have call predecessors, (24), 9 states have call successors, (24) [2025-03-04 10:54:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1434 transitions. [2025-03-04 10:54:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 10:54:23,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:23,182 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:23,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:54:23,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:54:23,383 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:23,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash -404886444, now seen corresponding path program 1 times [2025-03-04 10:54:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:23,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102283995] [2025-03-04 10:54:23,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:23,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:23,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 10:54:23,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 10:54:23,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:23,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:23,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:23,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102283995] [2025-03-04 10:54:23,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102283995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:23,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:23,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:54:23,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144512576] [2025-03-04 10:54:23,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:23,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:54:23,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:23,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:54:23,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:54:23,416 INFO L87 Difference]: Start difference. First operand 1038 states and 1434 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:54:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:23,487 INFO L93 Difference]: Finished difference Result 1038 states and 1434 transitions. [2025-03-04 10:54:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:54:23,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 95 [2025-03-04 10:54:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:23,490 INFO L225 Difference]: With dead ends: 1038 [2025-03-04 10:54:23,490 INFO L226 Difference]: Without dead ends: 1037 [2025-03-04 10:54:23,490 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-04 10:54:23,490 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:23,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 152 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:54:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-03-04 10:54:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2025-03-04 10:54:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 866 states have (on average 1.3221709006928406) internal successors, (1145), 888 states have internal predecessors, (1145), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 10:54:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1425 transitions. [2025-03-04 10:54:23,540 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1425 transitions. Word has length 95 [2025-03-04 10:54:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:23,540 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1425 transitions. [2025-03-04 10:54:23,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:54:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1425 transitions. [2025-03-04 10:54:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 10:54:23,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:23,541 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:23,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 10:54:23,541 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:23,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1746150802, now seen corresponding path program 1 times [2025-03-04 10:54:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591585646] [2025-03-04 10:54:23,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:23,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:54:23,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:54:23,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:23,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:23,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591585646] [2025-03-04 10:54:23,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591585646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735837970] [2025-03-04 10:54:23,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:23,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:23,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:23,595 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:23,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:54:23,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 10:54:23,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 10:54:23,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:23,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:23,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:54:23,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:23,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735837970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:23,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-04 10:54:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347110603] [2025-03-04 10:54:23,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:23,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:54:23,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:23,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:54:23,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:54:23,747 INFO L87 Difference]: Start difference. First operand 1037 states and 1425 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:54:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:23,890 INFO L93 Difference]: Finished difference Result 1055 states and 1456 transitions. [2025-03-04 10:54:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:54:23,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 97 [2025-03-04 10:54:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:23,896 INFO L225 Difference]: With dead ends: 1055 [2025-03-04 10:54:23,896 INFO L226 Difference]: Without dead ends: 1054 [2025-03-04 10:54:23,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:54:23,897 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 66 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:23,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 154 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-03-04 10:54:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1036. [2025-03-04 10:54:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 866 states have (on average 1.3140877598152425) internal successors, (1138), 887 states have internal predecessors, (1138), 140 states have call successors, (140), 8 states have call predecessors, (140), 8 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-04 10:54:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1418 transitions. [2025-03-04 10:54:23,940 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1418 transitions. Word has length 97 [2025-03-04 10:54:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:23,940 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1418 transitions. [2025-03-04 10:54:23,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:54:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1418 transitions. [2025-03-04 10:54:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 10:54:23,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:23,941 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:23,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:54:24,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:24,142 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:24,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:24,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1703900004, now seen corresponding path program 1 times [2025-03-04 10:54:24,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:24,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265096322] [2025-03-04 10:54:24,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:24,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:24,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:54:24,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:54:24,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:24,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:24,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:24,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265096322] [2025-03-04 10:54:24,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265096322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:24,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445996917] [2025-03-04 10:54:24,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:24,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:24,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:24,196 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:24,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:54:24,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 10:54:24,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 10:54:24,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:24,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:24,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:54:24,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:24,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:54:24,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445996917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:24,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:24,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:54:24,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905779714] [2025-03-04 10:54:24,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:24,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:54:24,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:24,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:54:24,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:54:24,446 INFO L87 Difference]: Start difference. First operand 1036 states and 1418 transitions. Second operand has 11 states, 10 states have (on average 15.6) internal successors, (156), 11 states have internal predecessors, (156), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 10:54:24,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:24,800 INFO L93 Difference]: Finished difference Result 1431 states and 1978 transitions. [2025-03-04 10:54:24,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:54:24,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.6) internal successors, (156), 11 states have internal predecessors, (156), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 98 [2025-03-04 10:54:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:24,806 INFO L225 Difference]: With dead ends: 1431 [2025-03-04 10:54:24,806 INFO L226 Difference]: Without dead ends: 1429 [2025-03-04 10:54:24,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:54:24,807 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 301 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:24,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 393 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2025-03-04 10:54:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1186. [2025-03-04 10:54:24,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 998 states have (on average 1.312625250501002) internal successors, (1310), 1019 states have internal predecessors, (1310), 158 states have call successors, (158), 8 states have call predecessors, (158), 8 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-04 10:54:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1626 transitions. [2025-03-04 10:54:24,901 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1626 transitions. Word has length 98 [2025-03-04 10:54:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:24,901 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1626 transitions. [2025-03-04 10:54:24,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.6) internal successors, (156), 11 states have internal predecessors, (156), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 10:54:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1626 transitions. [2025-03-04 10:54:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 10:54:24,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:24,904 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:24,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:54:25,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:25,104 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1153230206, now seen corresponding path program 1 times [2025-03-04 10:54:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:25,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871428601] [2025-03-04 10:54:25,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:25,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:25,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 10:54:25,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 10:54:25,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:25,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:54:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871428601] [2025-03-04 10:54:25,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871428601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693113473] [2025-03-04 10:54:25,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:25,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:25,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:25,183 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:25,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:54:25,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 10:54:25,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 10:54:25,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:25,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:25,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:54:25,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:54:25,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:54:25,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693113473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:25,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:25,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-04 10:54:25,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19766360] [2025-03-04 10:54:25,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:25,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:25,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:25,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:25,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:25,473 INFO L87 Difference]: Start difference. First operand 1186 states and 1626 transitions. Second operand has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 states have internal predecessors, (106), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 10:54:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:25,867 INFO L93 Difference]: Finished difference Result 1231 states and 1674 transitions. [2025-03-04 10:54:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:54:25,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 states have internal predecessors, (106), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 108 [2025-03-04 10:54:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:25,871 INFO L225 Difference]: With dead ends: 1231 [2025-03-04 10:54:25,871 INFO L226 Difference]: Without dead ends: 1230 [2025-03-04 10:54:25,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:54:25,872 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 382 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:25,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 364 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2025-03-04 10:54:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1115. [2025-03-04 10:54:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 938 states have (on average 1.3091684434968016) internal successors, (1228), 958 states have internal predecessors, (1228), 148 states have call successors, (148), 8 states have call predecessors, (148), 8 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-04 10:54:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1524 transitions. [2025-03-04 10:54:25,923 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1524 transitions. Word has length 108 [2025-03-04 10:54:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:25,923 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1524 transitions. [2025-03-04 10:54:25,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.777777777777779) internal successors, (106), 10 states have internal predecessors, (106), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 10:54:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1524 transitions. [2025-03-04 10:54:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 10:54:25,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:25,924 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:25,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:26,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:26,125 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:26,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:26,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1219009950, now seen corresponding path program 1 times [2025-03-04 10:54:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:26,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967123066] [2025-03-04 10:54:26,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:26,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 10:54:26,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 10:54:26,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:26,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:26,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [731278369] [2025-03-04 10:54:26,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:26,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:26,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:26,141 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:26,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:54:26,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 10:54:26,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 10:54:26,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:26,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:26,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:54:26,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:54:26,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967123066] [2025-03-04 10:54:26,650 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731278369] [2025-03-04 10:54:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731278369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:26,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:26,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 10:54:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424530332] [2025-03-04 10:54:26,650 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:26,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:26,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:26,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:54:26,651 INFO L87 Difference]: Start difference. First operand 1115 states and 1524 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:54:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:27,380 INFO L93 Difference]: Finished difference Result 2138 states and 2990 transitions. [2025-03-04 10:54:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:54:27,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 110 [2025-03-04 10:54:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:27,387 INFO L225 Difference]: With dead ends: 2138 [2025-03-04 10:54:27,387 INFO L226 Difference]: Without dead ends: 2135 [2025-03-04 10:54:27,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:54:27,388 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 247 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:27,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 583 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:54:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2025-03-04 10:54:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1171. [2025-03-04 10:54:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 985 states have (on average 1.3086294416243656) internal successors, (1289), 1005 states have internal predecessors, (1289), 157 states have call successors, (157), 8 states have call predecessors, (157), 8 states have return successors, (157), 157 states have call predecessors, (157), 157 states have call successors, (157) [2025-03-04 10:54:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1603 transitions. [2025-03-04 10:54:27,467 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1603 transitions. Word has length 110 [2025-03-04 10:54:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:27,467 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1603 transitions. [2025-03-04 10:54:27,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:54:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1603 transitions. [2025-03-04 10:54:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 10:54:27,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:27,468 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:27,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:27,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:27,669 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:27,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash 479272050, now seen corresponding path program 1 times [2025-03-04 10:54:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624111922] [2025-03-04 10:54:27,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:27,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 10:54:27,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 10:54:27,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:27,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:54:27,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:27,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624111922] [2025-03-04 10:54:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624111922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:27,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883494845] [2025-03-04 10:54:27,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:27,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:27,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:27,761 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:27,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:54:27,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 10:54:27,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 10:54:27,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:27,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:27,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:54:27,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 10:54:27,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:54:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883494845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:28,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:28,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-03-04 10:54:28,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586284169] [2025-03-04 10:54:28,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:28,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:54:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:28,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:54:28,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:54:28,074 INFO L87 Difference]: Start difference. First operand 1171 states and 1603 transitions. Second operand has 24 states, 23 states have (on average 8.08695652173913) internal successors, (186), 24 states have internal predecessors, (186), 9 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2025-03-04 10:54:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:28,590 INFO L93 Difference]: Finished difference Result 1900 states and 2516 transitions. [2025-03-04 10:54:28,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 10:54:28,590 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.08695652173913) internal successors, (186), 24 states have internal predecessors, (186), 9 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 110 [2025-03-04 10:54:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:28,595 INFO L225 Difference]: With dead ends: 1900 [2025-03-04 10:54:28,595 INFO L226 Difference]: Without dead ends: 1638 [2025-03-04 10:54:28,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=1920, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 10:54:28,596 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 397 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:28,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 815 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-03-04 10:54:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1441. [2025-03-04 10:54:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1216 states have (on average 1.2886513157894737) internal successors, (1567), 1236 states have internal predecessors, (1567), 190 states have call successors, (190), 14 states have call predecessors, (190), 14 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-03-04 10:54:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1947 transitions. [2025-03-04 10:54:28,678 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 1947 transitions. Word has length 110 [2025-03-04 10:54:28,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:28,678 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 1947 transitions. [2025-03-04 10:54:28,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.08695652173913) internal successors, (186), 24 states have internal predecessors, (186), 9 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2025-03-04 10:54:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1947 transitions. [2025-03-04 10:54:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 10:54:28,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:28,679 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:28,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:28,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 10:54:28,880 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:28,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash 865397259, now seen corresponding path program 1 times [2025-03-04 10:54:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950815786] [2025-03-04 10:54:28,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:28,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 10:54:28,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 10:54:28,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:28,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:28,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269815344] [2025-03-04 10:54:28,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:28,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:28,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:28,896 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:28,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:54:28,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 10:54:28,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 10:54:28,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:28,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:28,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:54:28,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:54:29,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:29,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950815786] [2025-03-04 10:54:29,516 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:29,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269815344] [2025-03-04 10:54:29,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269815344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:29,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:29,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 10:54:29,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106313484] [2025-03-04 10:54:29,517 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:29,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:29,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:29,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:54:29,517 INFO L87 Difference]: Start difference. First operand 1441 states and 1947 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:54:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:29,828 INFO L93 Difference]: Finished difference Result 1587 states and 2134 transitions. [2025-03-04 10:54:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:54:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 111 [2025-03-04 10:54:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:29,835 INFO L225 Difference]: With dead ends: 1587 [2025-03-04 10:54:29,835 INFO L226 Difference]: Without dead ends: 1584 [2025-03-04 10:54:29,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:54:29,835 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 94 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:29,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 361 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:29,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-03-04 10:54:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1555. [2025-03-04 10:54:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1313 states have (on average 1.2871287128712872) internal successors, (1690), 1333 states have internal predecessors, (1690), 207 states have call successors, (207), 14 states have call predecessors, (207), 14 states have return successors, (207), 207 states have call predecessors, (207), 207 states have call successors, (207) [2025-03-04 10:54:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2104 transitions. [2025-03-04 10:54:29,914 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2104 transitions. Word has length 111 [2025-03-04 10:54:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:29,914 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2104 transitions. [2025-03-04 10:54:29,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 5 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:54:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2104 transitions. [2025-03-04 10:54:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 10:54:29,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:29,915 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:29,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:30,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 10:54:30,116 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:30,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:30,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1057511296, now seen corresponding path program 1 times [2025-03-04 10:54:30,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:30,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642947587] [2025-03-04 10:54:30,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:30,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:30,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 10:54:30,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 10:54:30,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:30,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:54:30,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:30,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642947587] [2025-03-04 10:54:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642947587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:30,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:30,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:54:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586262467] [2025-03-04 10:54:30,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:30,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:54:30,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:30,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:54:30,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:54:30,165 INFO L87 Difference]: Start difference. First operand 1555 states and 2104 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 10:54:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:30,471 INFO L93 Difference]: Finished difference Result 1562 states and 2107 transitions. [2025-03-04 10:54:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:54:30,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 112 [2025-03-04 10:54:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:30,476 INFO L225 Difference]: With dead ends: 1562 [2025-03-04 10:54:30,476 INFO L226 Difference]: Without dead ends: 1560 [2025-03-04 10:54:30,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:54:30,476 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 105 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:30,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 226 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-03-04 10:54:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1521. [2025-03-04 10:54:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1285 states have (on average 1.2785992217898832) internal successors, (1643), 1303 states have internal predecessors, (1643), 203 states have call successors, (203), 14 states have call predecessors, (203), 14 states have return successors, (203), 203 states have call predecessors, (203), 203 states have call successors, (203) [2025-03-04 10:54:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2049 transitions. [2025-03-04 10:54:30,588 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2049 transitions. Word has length 112 [2025-03-04 10:54:30,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:30,588 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2049 transitions. [2025-03-04 10:54:30,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 10:54:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2049 transitions. [2025-03-04 10:54:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 10:54:30,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:30,589 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:30,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 10:54:30,589 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:30,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:30,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1576888151, now seen corresponding path program 1 times [2025-03-04 10:54:30,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:30,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351485916] [2025-03-04 10:54:30,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:30,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:30,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 10:54:30,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 10:54:30,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:30,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:30,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023742606] [2025-03-04 10:54:30,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:30,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:30,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:30,608 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:30,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:54:30,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 10:54:30,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 10:54:30,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:30,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:30,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:54:30,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-04 10:54:30,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:35,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:35,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351485916] [2025-03-04 10:54:35,165 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:35,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023742606] [2025-03-04 10:54:35,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023742606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:35,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:35,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:54:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633748116] [2025-03-04 10:54:35,165 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:35,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:54:35,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:35,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:54:35,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=164, Unknown=1, NotChecked=0, Total=210 [2025-03-04 10:54:35,166 INFO L87 Difference]: Start difference. First operand 1521 states and 2049 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 10:54:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:35,522 INFO L93 Difference]: Finished difference Result 1543 states and 2061 transitions. [2025-03-04 10:54:35,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:54:35,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 113 [2025-03-04 10:54:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:35,526 INFO L225 Difference]: With dead ends: 1543 [2025-03-04 10:54:35,527 INFO L226 Difference]: Without dead ends: 1536 [2025-03-04 10:54:35,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=90, Invalid=329, Unknown=1, NotChecked=0, Total=420 [2025-03-04 10:54:35,527 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 212 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:35,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 323 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-03-04 10:54:35,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1387. [2025-03-04 10:54:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1171 states have (on average 1.2758326216908624) internal successors, (1494), 1190 states have internal predecessors, (1494), 183 states have call successors, (183), 14 states have call predecessors, (183), 14 states have return successors, (183), 182 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-04 10:54:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1860 transitions. [2025-03-04 10:54:35,594 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1860 transitions. Word has length 113 [2025-03-04 10:54:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:35,594 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 1860 transitions. [2025-03-04 10:54:35,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 9 states have internal predecessors, (66), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 10:54:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1860 transitions. [2025-03-04 10:54:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 10:54:35,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:35,595 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:35,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:35,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 10:54:35,800 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:35,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1522377384, now seen corresponding path program 2 times [2025-03-04 10:54:35,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:35,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104538017] [2025-03-04 10:54:35,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:35,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-04 10:54:35,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 10:54:35,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:35,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:35,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992480127] [2025-03-04 10:54:35,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:35,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:35,823 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:35,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:54:35,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-04 10:54:35,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 10:54:35,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:35,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:35,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:54:35,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-04 10:54:36,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104538017] [2025-03-04 10:54:36,200 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992480127] [2025-03-04 10:54:36,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992480127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:36,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:36,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 10:54:36,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658454494] [2025-03-04 10:54:36,200 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:36,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:54:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:36,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:54:36,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:54:36,201 INFO L87 Difference]: Start difference. First operand 1387 states and 1860 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:54:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:36,594 INFO L93 Difference]: Finished difference Result 1695 states and 2316 transitions. [2025-03-04 10:54:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:54:36,595 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 113 [2025-03-04 10:54:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:36,600 INFO L225 Difference]: With dead ends: 1695 [2025-03-04 10:54:36,600 INFO L226 Difference]: Without dead ends: 1691 [2025-03-04 10:54:36,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:54:36,601 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 218 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:36,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 461 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2025-03-04 10:54:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1387. [2025-03-04 10:54:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1171 states have (on average 1.2604611443210931) internal successors, (1476), 1190 states have internal predecessors, (1476), 183 states have call successors, (183), 14 states have call predecessors, (183), 14 states have return successors, (183), 182 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-04 10:54:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1842 transitions. [2025-03-04 10:54:36,680 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1842 transitions. Word has length 113 [2025-03-04 10:54:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:36,680 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 1842 transitions. [2025-03-04 10:54:36,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 11 states have internal predecessors, (69), 5 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 10:54:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1842 transitions. [2025-03-04 10:54:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 10:54:36,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:36,681 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:54:36,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:36,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:36,881 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:36,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash 599473448, now seen corresponding path program 2 times [2025-03-04 10:54:36,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:36,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56357559] [2025-03-04 10:54:36,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:36,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:36,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-04 10:54:36,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 10:54:36,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:36,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:54:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56357559] [2025-03-04 10:54:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56357559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:36,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:54:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020416511] [2025-03-04 10:54:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:36,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:54:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:36,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:54:36,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:54:36,943 INFO L87 Difference]: Start difference. First operand 1387 states and 1842 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 10:54:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:37,299 INFO L93 Difference]: Finished difference Result 2418 states and 3261 transitions. [2025-03-04 10:54:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:54:37,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 123 [2025-03-04 10:54:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:37,303 INFO L225 Difference]: With dead ends: 2418 [2025-03-04 10:54:37,303 INFO L226 Difference]: Without dead ends: 1424 [2025-03-04 10:54:37,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:54:37,307 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:37,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 178 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2025-03-04 10:54:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1357. [2025-03-04 10:54:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1145 states have (on average 1.2724890829694324) internal successors, (1457), 1163 states have internal predecessors, (1457), 181 states have call successors, (181), 12 states have call predecessors, (181), 12 states have return successors, (181), 181 states have call predecessors, (181), 181 states have call successors, (181) [2025-03-04 10:54:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1819 transitions. [2025-03-04 10:54:37,374 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1819 transitions. Word has length 123 [2025-03-04 10:54:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:37,374 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1819 transitions. [2025-03-04 10:54:37,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 4 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 10:54:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1819 transitions. [2025-03-04 10:54:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 10:54:37,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:37,374 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:37,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 10:54:37,375 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:37,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash 646521900, now seen corresponding path program 1 times [2025-03-04 10:54:37,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:37,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188486467] [2025-03-04 10:54:37,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:37,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 10:54:37,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 10:54:37,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:37,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:54:37,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188486467] [2025-03-04 10:54:37,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188486467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119320574] [2025-03-04 10:54:37,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:37,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:37,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:37,481 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:37,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:54:37,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 10:54:37,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 10:54:37,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:37,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:37,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:54:37,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 2 proven. 213 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 10:54:37,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:54:37,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119320574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:37,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:37,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2025-03-04 10:54:37,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614720947] [2025-03-04 10:54:37,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:37,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:54:37,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:37,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:54:37,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:54:37,768 INFO L87 Difference]: Start difference. First operand 1357 states and 1819 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 8 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 8 states have call predecessors, (33), 8 states have call successors, (33) [2025-03-04 10:54:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:38,146 INFO L93 Difference]: Finished difference Result 1987 states and 2609 transitions. [2025-03-04 10:54:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 10:54:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 8 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 8 states have call predecessors, (33), 8 states have call successors, (33) Word has length 125 [2025-03-04 10:54:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:38,150 INFO L225 Difference]: With dead ends: 1987 [2025-03-04 10:54:38,150 INFO L226 Difference]: Without dead ends: 1507 [2025-03-04 10:54:38,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=467, Invalid=1513, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 10:54:38,152 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 267 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:38,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 789 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-03-04 10:54:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1458. [2025-03-04 10:54:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1229 states have (on average 1.2530512611879576) internal successors, (1540), 1249 states have internal predecessors, (1540), 190 states have call successors, (190), 20 states have call predecessors, (190), 20 states have return successors, (190), 188 states have call predecessors, (190), 190 states have call successors, (190) [2025-03-04 10:54:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1920 transitions. [2025-03-04 10:54:38,229 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1920 transitions. Word has length 125 [2025-03-04 10:54:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:38,230 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 1920 transitions. [2025-03-04 10:54:38,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 8 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 8 states have call predecessors, (33), 8 states have call successors, (33) [2025-03-04 10:54:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1920 transitions. [2025-03-04 10:54:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 10:54:38,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:38,230 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:38,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:38,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 10:54:38,431 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:38,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1585510176, now seen corresponding path program 2 times [2025-03-04 10:54:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703256992] [2025-03-04 10:54:38,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:38,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-04 10:54:38,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 10:54:38,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:38,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:38,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592022483] [2025-03-04 10:54:38,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:38,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:38,446 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:38,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:54:38,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-04 10:54:38,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 10:54:38,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:38,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:38,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:54:38,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:54:38,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:54:38,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:38,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703256992] [2025-03-04 10:54:38,817 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:38,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592022483] [2025-03-04 10:54:38,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592022483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:38,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:38,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:54:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881842771] [2025-03-04 10:54:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:38,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:38,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:38,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:38,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:54:38,818 INFO L87 Difference]: Start difference. First operand 1458 states and 1920 transitions. Second operand has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 10 states have internal predecessors, (84), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 10:54:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:39,233 INFO L93 Difference]: Finished difference Result 1991 states and 2670 transitions. [2025-03-04 10:54:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:54:39,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 10 states have internal predecessors, (84), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 151 [2025-03-04 10:54:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:39,237 INFO L225 Difference]: With dead ends: 1991 [2025-03-04 10:54:39,237 INFO L226 Difference]: Without dead ends: 1988 [2025-03-04 10:54:39,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:54:39,238 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 194 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:39,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 550 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2025-03-04 10:54:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1047. [2025-03-04 10:54:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 877 states have (on average 1.2075256556442417) internal successors, (1059), 894 states have internal predecessors, (1059), 134 states have call successors, (134), 20 states have call predecessors, (134), 20 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-04 10:54:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1327 transitions. [2025-03-04 10:54:39,300 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1327 transitions. Word has length 151 [2025-03-04 10:54:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:39,300 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1327 transitions. [2025-03-04 10:54:39,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.333333333333334) internal successors, (84), 10 states have internal predecessors, (84), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 10:54:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1327 transitions. [2025-03-04 10:54:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 10:54:39,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:39,301 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:39,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:54:39,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-03-04 10:54:39,505 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:39,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1906175155, now seen corresponding path program 2 times [2025-03-04 10:54:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:39,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672231472] [2025-03-04 10:54:39,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:39,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-04 10:54:39,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 10:54:39,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:39,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583133770] [2025-03-04 10:54:39,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:39,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:39,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:39,521 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:39,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:54:39,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-04 10:54:39,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 10:54:39,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:39,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:39,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:54:39,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:54:39,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672231472] [2025-03-04 10:54:40,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583133770] [2025-03-04 10:54:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583133770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:40,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 10:54:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199517950] [2025-03-04 10:54:40,062 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:40,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:40,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:40,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:54:40,062 INFO L87 Difference]: Start difference. First operand 1047 states and 1327 transitions. Second operand has 10 states, 9 states have (on average 9.444444444444445) internal successors, (85), 10 states have internal predecessors, (85), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 10:54:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:40,262 INFO L93 Difference]: Finished difference Result 1174 states and 1492 transitions. [2025-03-04 10:54:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:54:40,263 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.444444444444445) internal successors, (85), 10 states have internal predecessors, (85), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 152 [2025-03-04 10:54:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:40,266 INFO L225 Difference]: With dead ends: 1174 [2025-03-04 10:54:40,266 INFO L226 Difference]: Without dead ends: 1171 [2025-03-04 10:54:40,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:54:40,266 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 160 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:40,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 269 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:40,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-03-04 10:54:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1148. [2025-03-04 10:54:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 962 states have (on average 1.212058212058212) internal successors, (1166), 979 states have internal predecessors, (1166), 150 states have call successors, (150), 20 states have call predecessors, (150), 20 states have return successors, (150), 148 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-04 10:54:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1466 transitions. [2025-03-04 10:54:40,336 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1466 transitions. Word has length 152 [2025-03-04 10:54:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:40,336 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1466 transitions. [2025-03-04 10:54:40,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.444444444444445) internal successors, (85), 10 states have internal predecessors, (85), 6 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-04 10:54:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1466 transitions. [2025-03-04 10:54:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 10:54:40,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:40,337 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:40,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-04 10:54:40,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-04 10:54:40,538 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:40,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2116712811, now seen corresponding path program 2 times [2025-03-04 10:54:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758998057] [2025-03-04 10:54:40,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:40,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-04 10:54:40,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 10:54:40,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:40,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:40,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583386686] [2025-03-04 10:54:40,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:40,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:40,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:40,552 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:40,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-04 10:54:40,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-04 10:54:40,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 10:54:40,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:40,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:40,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:54:40,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:54:40,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:41,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758998057] [2025-03-04 10:54:41,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583386686] [2025-03-04 10:54:41,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583386686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:41,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:41,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-04 10:54:41,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104602312] [2025-03-04 10:54:41,559 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:41,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:54:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:41,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:54:41,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:54:41,560 INFO L87 Difference]: Start difference. First operand 1148 states and 1466 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:54:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:42,119 INFO L93 Difference]: Finished difference Result 1171 states and 1477 transitions. [2025-03-04 10:54:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:54:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 154 [2025-03-04 10:54:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:42,122 INFO L225 Difference]: With dead ends: 1171 [2025-03-04 10:54:42,122 INFO L226 Difference]: Without dead ends: 1164 [2025-03-04 10:54:42,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:54:42,123 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 79 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:42,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 657 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:54:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-03-04 10:54:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1072. [2025-03-04 10:54:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 898 states have (on average 1.1971046770601337) internal successors, (1075), 915 states have internal predecessors, (1075), 138 states have call successors, (138), 20 states have call predecessors, (138), 20 states have return successors, (138), 136 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-04 10:54:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1351 transitions. [2025-03-04 10:54:42,192 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1351 transitions. Word has length 154 [2025-03-04 10:54:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:42,192 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1351 transitions. [2025-03-04 10:54:42,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 12 states have internal predecessors, (87), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-04 10:54:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1351 transitions. [2025-03-04 10:54:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 10:54:42,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:42,193 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:42,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:42,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:42,393 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:42,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash 921011050, now seen corresponding path program 3 times [2025-03-04 10:54:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:42,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100851712] [2025-03-04 10:54:42,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:42,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 13 equivalence classes. [2025-03-04 10:54:42,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 10:54:42,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-04 10:54:42,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:42,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135159928] [2025-03-04 10:54:42,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:42,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:42,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:42,425 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:42,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-04 10:54:42,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 13 equivalence classes. [2025-03-04 10:54:42,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 154 statements. [2025-03-04 10:54:42,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:54:42,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:42,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:54:42,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 45 proven. 26 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-03-04 10:54:42,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:42,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:42,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100851712] [2025-03-04 10:54:42,878 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:42,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135159928] [2025-03-04 10:54:42,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135159928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:42,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-04 10:54:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040119838] [2025-03-04 10:54:42,878 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:42,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:54:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:42,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:54:42,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:54:42,879 INFO L87 Difference]: Start difference. First operand 1072 states and 1351 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:54:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:43,459 INFO L93 Difference]: Finished difference Result 1292 states and 1641 transitions. [2025-03-04 10:54:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:54:43,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 154 [2025-03-04 10:54:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:43,462 INFO L225 Difference]: With dead ends: 1292 [2025-03-04 10:54:43,462 INFO L226 Difference]: Without dead ends: 1288 [2025-03-04 10:54:43,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:54:43,463 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 327 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:43,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 378 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:54:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-03-04 10:54:43,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1062. [2025-03-04 10:54:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 888 states have (on average 1.177927927927928) internal successors, (1046), 905 states have internal predecessors, (1046), 138 states have call successors, (138), 20 states have call predecessors, (138), 20 states have return successors, (138), 136 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-04 10:54:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1322 transitions. [2025-03-04 10:54:43,527 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1322 transitions. Word has length 154 [2025-03-04 10:54:43,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:43,528 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1322 transitions. [2025-03-04 10:54:43,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:54:43,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1322 transitions. [2025-03-04 10:54:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 10:54:43,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:43,528 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:43,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-04 10:54:43,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:43,729 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:43,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:43,729 INFO L85 PathProgramCache]: Analyzing trace with hash 752522090, now seen corresponding path program 3 times [2025-03-04 10:54:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741815385] [2025-03-04 10:54:43,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:43,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 164 statements into 11 equivalence classes. [2025-03-04 10:54:43,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 10:54:43,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:54:43,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:43,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063036504] [2025-03-04 10:54:43,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:43,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:43,760 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:43,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-04 10:54:43,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 164 statements into 11 equivalence classes. [2025-03-04 10:54:43,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 72 of 164 statements. [2025-03-04 10:54:43,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:54:43,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:43,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:54:43,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 99 proven. 76 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-04 10:54:44,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741815385] [2025-03-04 10:54:44,785 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:44,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063036504] [2025-03-04 10:54:44,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063036504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:44,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:44,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-04 10:54:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632555041] [2025-03-04 10:54:44,786 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:44,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:54:44,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:44,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:54:44,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:54:44,787 INFO L87 Difference]: Start difference. First operand 1062 states and 1322 transitions. Second operand has 13 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 4 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:54:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:46,361 INFO L93 Difference]: Finished difference Result 1189 states and 1485 transitions. [2025-03-04 10:54:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:54:46,361 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 4 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 164 [2025-03-04 10:54:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:46,364 INFO L225 Difference]: With dead ends: 1189 [2025-03-04 10:54:46,364 INFO L226 Difference]: Without dead ends: 1167 [2025-03-04 10:54:46,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:54:46,365 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 352 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:46,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 288 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:54:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2025-03-04 10:54:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1025. [2025-03-04 10:54:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 865 states have (on average 1.138728323699422) internal successors, (985), 881 states have internal predecessors, (985), 125 states have call successors, (125), 20 states have call predecessors, (125), 20 states have return successors, (125), 123 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-04 10:54:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1235 transitions. [2025-03-04 10:54:46,434 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1235 transitions. Word has length 164 [2025-03-04 10:54:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:46,434 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1235 transitions. [2025-03-04 10:54:46,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.916666666666667) internal successors, (83), 13 states have internal predecessors, (83), 4 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:54:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1235 transitions. [2025-03-04 10:54:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 10:54:46,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:46,435 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:46,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:46,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:46,636 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:46,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1619224136, now seen corresponding path program 3 times [2025-03-04 10:54:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:46,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685041572] [2025-03-04 10:54:46,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:46,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 166 statements into 11 equivalence classes. [2025-03-04 10:54:46,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 10:54:46,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:54:46,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:46,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927381096] [2025-03-04 10:54:46,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:54:46,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:46,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:46,664 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:46,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-04 10:54:46,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 166 statements into 11 equivalence classes. [2025-03-04 10:54:46,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 74 of 166 statements. [2025-03-04 10:54:46,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:54:46,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:46,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:54:46,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 66 proven. 79 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-04 10:54:46,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:47,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685041572] [2025-03-04 10:54:47,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927381096] [2025-03-04 10:54:47,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927381096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:47,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:47,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-04 10:54:47,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649561768] [2025-03-04 10:54:47,048 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:47,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:54:47,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:47,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:54:47,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:54:47,048 INFO L87 Difference]: Start difference. First operand 1025 states and 1235 transitions. Second operand has 11 states, 10 states have (on average 8.2) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:54:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:47,633 INFO L93 Difference]: Finished difference Result 1040 states and 1252 transitions. [2025-03-04 10:54:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:54:47,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.2) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 166 [2025-03-04 10:54:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:47,635 INFO L225 Difference]: With dead ends: 1040 [2025-03-04 10:54:47,635 INFO L226 Difference]: Without dead ends: 1010 [2025-03-04 10:54:47,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:54:47,636 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 223 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:47,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 212 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:54:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-04 10:54:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 958. [2025-03-04 10:54:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 805 states have (on average 1.1341614906832298) internal successors, (913), 818 states have internal predecessors, (913), 119 states have call successors, (119), 20 states have call predecessors, (119), 20 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-04 10:54:47,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1151 transitions. [2025-03-04 10:54:47,715 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1151 transitions. Word has length 166 [2025-03-04 10:54:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:47,716 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1151 transitions. [2025-03-04 10:54:47,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.2) internal successors, (82), 11 states have internal predecessors, (82), 4 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:54:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1151 transitions. [2025-03-04 10:54:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-04 10:54:47,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:47,717 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:47,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-03-04 10:54:47,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-03-04 10:54:47,917 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:47,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1265650496, now seen corresponding path program 2 times [2025-03-04 10:54:47,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:47,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684479764] [2025-03-04 10:54:47,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:47,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-04 10:54:47,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 10:54:47,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:47,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 10:54:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684479764] [2025-03-04 10:54:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684479764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:48,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:48,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:54:48,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476211331] [2025-03-04 10:54:48,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:48,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:54:48,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:48,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:54:48,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:54:48,062 INFO L87 Difference]: Start difference. First operand 958 states and 1151 transitions. Second operand has 9 states, 8 states have (on average 14.125) internal successors, (113), 9 states have internal predecessors, (113), 6 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-04 10:54:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:48,408 INFO L93 Difference]: Finished difference Result 1197 states and 1435 transitions. [2025-03-04 10:54:48,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:54:48,409 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 14.125) internal successors, (113), 9 states have internal predecessors, (113), 6 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 215 [2025-03-04 10:54:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:48,411 INFO L225 Difference]: With dead ends: 1197 [2025-03-04 10:54:48,411 INFO L226 Difference]: Without dead ends: 1196 [2025-03-04 10:54:48,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:54:48,411 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 263 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:48,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 416 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-03-04 10:54:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 957. [2025-03-04 10:54:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 805 states have (on average 1.1229813664596273) internal successors, (904), 817 states have internal predecessors, (904), 119 states have call successors, (119), 20 states have call predecessors, (119), 20 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-04 10:54:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1142 transitions. [2025-03-04 10:54:48,479 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1142 transitions. Word has length 215 [2025-03-04 10:54:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:48,480 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1142 transitions. [2025-03-04 10:54:48,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 14.125) internal successors, (113), 9 states have internal predecessors, (113), 6 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2025-03-04 10:54:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1142 transitions. [2025-03-04 10:54:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 10:54:48,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:48,481 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:48,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-04 10:54:48,481 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:48,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1034558371, now seen corresponding path program 1 times [2025-03-04 10:54:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:48,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602645995] [2025-03-04 10:54:48,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:48,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 10:54:48,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 10:54:48,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:48,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-04 10:54:48,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:48,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602645995] [2025-03-04 10:54:48,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602645995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:48,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650624851] [2025-03-04 10:54:48,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:48,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:48,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:48,638 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:48,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-04 10:54:48,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 10:54:48,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 10:54:48,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:48,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:48,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:54:48,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 579 proven. 48 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2025-03-04 10:54:48,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:48,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 131 proven. 48 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2025-03-04 10:54:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650624851] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:48,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-04 10:54:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699104020] [2025-03-04 10:54:48,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:54:48,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:48,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:54:48,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:54:48,966 INFO L87 Difference]: Start difference. First operand 957 states and 1142 transitions. Second operand has 15 states, 15 states have (on average 15.466666666666667) internal successors, (232), 15 states have internal predecessors, (232), 13 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 13 states have call predecessors, (44), 13 states have call successors, (44) [2025-03-04 10:54:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:49,965 INFO L93 Difference]: Finished difference Result 1627 states and 1972 transitions. [2025-03-04 10:54:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:54:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 15.466666666666667) internal successors, (232), 15 states have internal predecessors, (232), 13 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 13 states have call predecessors, (44), 13 states have call successors, (44) Word has length 233 [2025-03-04 10:54:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:49,971 INFO L225 Difference]: With dead ends: 1627 [2025-03-04 10:54:49,971 INFO L226 Difference]: Without dead ends: 1022 [2025-03-04 10:54:49,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 458 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:54:49,972 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 278 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:49,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 783 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:54:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-03-04 10:54:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 954. [2025-03-04 10:54:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 805 states have (on average 1.137888198757764) internal successors, (916), 817 states have internal predecessors, (916), 120 states have call successors, (120), 16 states have call predecessors, (120), 16 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-04 10:54:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1156 transitions. [2025-03-04 10:54:50,046 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1156 transitions. Word has length 233 [2025-03-04 10:54:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:50,047 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1156 transitions. [2025-03-04 10:54:50,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.466666666666667) internal successors, (232), 15 states have internal predecessors, (232), 13 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 13 states have call predecessors, (44), 13 states have call successors, (44) [2025-03-04 10:54:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1156 transitions. [2025-03-04 10:54:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 10:54:50,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:50,048 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:50,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:50,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 10:54:50,249 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:50,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash -410867939, now seen corresponding path program 2 times [2025-03-04 10:54:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025147239] [2025-03-04 10:54:50,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:50,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 233 statements into 2 equivalence classes. [2025-03-04 10:54:50,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 10:54:50,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:50,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-04 10:54:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:50,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025147239] [2025-03-04 10:54:50,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025147239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636869265] [2025-03-04 10:54:50,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:50,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:50,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:50,402 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:50,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-04 10:54:50,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 233 statements into 2 equivalence classes. [2025-03-04 10:54:50,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 10:54:50,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:50,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:50,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:54:50,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-04 10:54:50,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-04 10:54:50,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636869265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:50,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:50,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 10:54:50,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433419917] [2025-03-04 10:54:50,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:50,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:54:50,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:50,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:54:50,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=291, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:54:50,931 INFO L87 Difference]: Start difference. First operand 954 states and 1156 transitions. Second operand has 22 states, 21 states have (on average 16.952380952380953) internal successors, (356), 22 states have internal predecessors, (356), 20 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) [2025-03-04 10:54:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:51,736 INFO L93 Difference]: Finished difference Result 2306 states and 2892 transitions. [2025-03-04 10:54:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 10:54:51,737 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 16.952380952380953) internal successors, (356), 22 states have internal predecessors, (356), 20 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) Word has length 233 [2025-03-04 10:54:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:51,740 INFO L225 Difference]: With dead ends: 2306 [2025-03-04 10:54:51,740 INFO L226 Difference]: Without dead ends: 2305 [2025-03-04 10:54:51,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=587, Invalid=973, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:54:51,741 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1357 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:51,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 654 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:54:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2025-03-04 10:54:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 1571. [2025-03-04 10:54:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1339 states have (on average 1.152352501867065) internal successors, (1543), 1351 states have internal predecessors, (1543), 203 states have call successors, (203), 16 states have call predecessors, (203), 16 states have return successors, (203), 203 states have call predecessors, (203), 203 states have call successors, (203) [2025-03-04 10:54:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 1949 transitions. [2025-03-04 10:54:51,883 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 1949 transitions. Word has length 233 [2025-03-04 10:54:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:51,883 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 1949 transitions. [2025-03-04 10:54:51,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 16.952380952380953) internal successors, (356), 22 states have internal predecessors, (356), 20 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) [2025-03-04 10:54:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1949 transitions. [2025-03-04 10:54:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-04 10:54:51,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:51,885 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:51,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-04 10:54:52,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-04 10:54:52,085 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:52,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1449948824, now seen corresponding path program 1 times [2025-03-04 10:54:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:52,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528819582] [2025-03-04 10:54:52,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:52,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-04 10:54:52,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-04 10:54:52,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:52,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-04 10:54:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528819582] [2025-03-04 10:54:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528819582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095062219] [2025-03-04 10:54:52,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:52,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:52,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:52,371 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:52,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-04 10:54:52,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-04 10:54:52,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-04 10:54:52,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:52,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:52,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:54:52,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 1032 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 10:54:52,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-04 10:54:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095062219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:52,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 24 [2025-03-04 10:54:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779450999] [2025-03-04 10:54:52,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:52,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:54:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:52,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:54:52,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:54:52,889 INFO L87 Difference]: Start difference. First operand 1571 states and 1949 transitions. Second operand has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 9 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 9 states have call predecessors, (56), 9 states have call successors, (56) [2025-03-04 10:54:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:53,355 INFO L93 Difference]: Finished difference Result 2252 states and 2786 transitions. [2025-03-04 10:54:53,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 10:54:53,355 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 9 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 9 states have call predecessors, (56), 9 states have call successors, (56) Word has length 239 [2025-03-04 10:54:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:53,360 INFO L225 Difference]: With dead ends: 2252 [2025-03-04 10:54:53,360 INFO L226 Difference]: Without dead ends: 1660 [2025-03-04 10:54:53,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 462 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=1741, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:54:53,362 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:53,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 655 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-04 10:54:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1628. [2025-03-04 10:54:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1384 states have (on average 1.14378612716763) internal successors, (1583), 1397 states have internal predecessors, (1583), 207 states have call successors, (207), 24 states have call predecessors, (207), 24 states have return successors, (207), 206 states have call predecessors, (207), 207 states have call successors, (207) [2025-03-04 10:54:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1997 transitions. [2025-03-04 10:54:53,528 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1997 transitions. Word has length 239 [2025-03-04 10:54:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:53,529 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 1997 transitions. [2025-03-04 10:54:53,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 9 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 9 states have call predecessors, (56), 9 states have call successors, (56) [2025-03-04 10:54:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1997 transitions. [2025-03-04 10:54:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-04 10:54:53,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:53,530 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:54:53,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-04 10:54:53,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-04 10:54:53,734 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:53,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash -315090693, now seen corresponding path program 1 times [2025-03-04 10:54:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46744503] [2025-03-04 10:54:53,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:53,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 10:54:53,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 10:54:53,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:53,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 317 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 10:54:54,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46744503] [2025-03-04 10:54:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46744503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976325826] [2025-03-04 10:54:54,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:54,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:54,021 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:54,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-04 10:54:54,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-04 10:54:54,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-04 10:54:54,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:54,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:54,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:54:54,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 482 proven. 187 refuted. 0 times theorem prover too weak. 948 trivial. 0 not checked. [2025-03-04 10:54:54,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 130 proven. 187 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-04 10:54:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976325826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:54,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:54,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 29 [2025-03-04 10:54:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488531788] [2025-03-04 10:54:54,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:54,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:54:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:54,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:54:54,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:54:54,495 INFO L87 Difference]: Start difference. First operand 1628 states and 1997 transitions. Second operand has 29 states, 29 states have (on average 10.931034482758621) internal successors, (317), 29 states have internal predecessors, (317), 17 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 17 states have call predecessors, (59), 17 states have call successors, (59) [2025-03-04 10:54:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:56,550 INFO L93 Difference]: Finished difference Result 3261 states and 4086 transitions. [2025-03-04 10:54:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-03-04 10:54:56,551 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 10.931034482758621) internal successors, (317), 29 states have internal predecessors, (317), 17 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 17 states have call predecessors, (59), 17 states have call successors, (59) Word has length 277 [2025-03-04 10:54:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:56,555 INFO L225 Difference]: With dead ends: 3261 [2025-03-04 10:54:56,555 INFO L226 Difference]: Without dead ends: 2195 [2025-03-04 10:54:56,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 543 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=797, Invalid=5523, Unknown=0, NotChecked=0, Total=6320 [2025-03-04 10:54:56,557 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 591 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:56,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1176 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 10:54:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2025-03-04 10:54:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1887. [2025-03-04 10:54:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1601 states have (on average 1.1449094316052468) internal successors, (1833), 1614 states have internal predecessors, (1833), 249 states have call successors, (249), 24 states have call predecessors, (249), 24 states have return successors, (249), 248 states have call predecessors, (249), 249 states have call successors, (249) [2025-03-04 10:54:56,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2331 transitions. [2025-03-04 10:54:56,764 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2331 transitions. Word has length 277 [2025-03-04 10:54:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:56,765 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2331 transitions. [2025-03-04 10:54:56,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.931034482758621) internal successors, (317), 29 states have internal predecessors, (317), 17 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 17 states have call predecessors, (59), 17 states have call successors, (59) [2025-03-04 10:54:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2331 transitions. [2025-03-04 10:54:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-04 10:54:56,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:56,767 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:56,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-03-04 10:54:56,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:56,967 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:54:56,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash 511321580, now seen corresponding path program 2 times [2025-03-04 10:54:56,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:56,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546407450] [2025-03-04 10:54:56,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:56,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 289 statements into 2 equivalence classes. [2025-03-04 10:54:56,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 289 of 289 statements. [2025-03-04 10:54:56,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:56,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-04 10:54:57,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:57,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546407450] [2025-03-04 10:54:57,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546407450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:57,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977690945] [2025-03-04 10:54:57,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:54:57,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:57,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:57,156 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:57,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-03-04 10:54:57,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 289 statements into 2 equivalence classes. [2025-03-04 10:54:57,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 289 of 289 statements. [2025-03-04 10:54:57,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:54:57,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:57,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:54:57,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 13 proven. 356 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-04 10:54:57,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1773 backedges. 13 proven. 356 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-04 10:54:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977690945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:58,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:58,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2025-03-04 10:54:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304912042] [2025-03-04 10:54:58,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:58,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 10:54:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:58,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 10:54:58,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:54:58,166 INFO L87 Difference]: Start difference. First operand 1887 states and 2331 transitions. Second operand has 33 states, 32 states have (on average 14.0625) internal successors, (450), 33 states have internal predecessors, (450), 25 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 25 states have call predecessors, (79), 25 states have call successors, (79) [2025-03-04 10:55:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:08,717 INFO L93 Difference]: Finished difference Result 6694 states and 8452 transitions. [2025-03-04 10:55:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2025-03-04 10:55:08,718 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 14.0625) internal successors, (450), 33 states have internal predecessors, (450), 25 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 25 states have call predecessors, (79), 25 states have call successors, (79) Word has length 289 [2025-03-04 10:55:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:08,727 INFO L225 Difference]: With dead ends: 6694 [2025-03-04 10:55:08,727 INFO L226 Difference]: Without dead ends: 5488 [2025-03-04 10:55:08,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25126 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9958, Invalid=50312, Unknown=0, NotChecked=0, Total=60270 [2025-03-04 10:55:08,733 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 6146 mSDsluCounter, 4412 mSDsCounter, 0 mSdLazyCounter, 8123 mSolverCounterSat, 1114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6152 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 9237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1114 IncrementalHoareTripleChecker+Valid, 8123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:08,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6152 Valid, 4682 Invalid, 9237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1114 Valid, 8123 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 10:55:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2025-03-04 10:55:09,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 2941. [2025-03-04 10:55:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2523 states have (on average 1.1728101466508125) internal successors, (2959), 2536 states have internal predecessors, (2959), 381 states have call successors, (381), 24 states have call predecessors, (381), 24 states have return successors, (381), 380 states have call predecessors, (381), 381 states have call successors, (381) [2025-03-04 10:55:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 3721 transitions. [2025-03-04 10:55:09,120 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 3721 transitions. Word has length 289 [2025-03-04 10:55:09,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:09,121 INFO L471 AbstractCegarLoop]: Abstraction has 2941 states and 3721 transitions. [2025-03-04 10:55:09,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 14.0625) internal successors, (450), 33 states have internal predecessors, (450), 25 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 25 states have call predecessors, (79), 25 states have call successors, (79) [2025-03-04 10:55:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 3721 transitions. [2025-03-04 10:55:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-04 10:55:09,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:09,123 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:09,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-03-04 10:55:09,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:09,324 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:55:09,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1437516829, now seen corresponding path program 2 times [2025-03-04 10:55:09,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:09,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904118365] [2025-03-04 10:55:09,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:55:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:09,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 292 statements into 2 equivalence classes. [2025-03-04 10:55:09,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 10:55:09,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:55:09,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-04 10:55:09,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:09,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904118365] [2025-03-04 10:55:09,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904118365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:09,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627942069] [2025-03-04 10:55:09,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:55:09,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:09,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:09,614 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:55:09,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-03-04 10:55:09,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 292 statements into 2 equivalence classes. [2025-03-04 10:55:09,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 292 of 292 statements. [2025-03-04 10:55:09,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:55:09,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:09,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:55:09,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 1614 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 10:55:09,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:10,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-04 10:55:10,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627942069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:10,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:10,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 22 [2025-03-04 10:55:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580752251] [2025-03-04 10:55:10,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:10,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:55:10,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:10,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:55:10,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:55:10,211 INFO L87 Difference]: Start difference. First operand 2941 states and 3721 transitions. Second operand has 22 states, 22 states have (on average 8.5) internal successors, (187), 22 states have internal predecessors, (187), 9 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) [2025-03-04 10:55:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:10,840 INFO L93 Difference]: Finished difference Result 3024 states and 3809 transitions. [2025-03-04 10:55:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:55:10,840 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.5) internal successors, (187), 22 states have internal predecessors, (187), 9 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) Word has length 292 [2025-03-04 10:55:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:10,845 INFO L225 Difference]: With dead ends: 3024 [2025-03-04 10:55:10,845 INFO L226 Difference]: Without dead ends: 2899 [2025-03-04 10:55:10,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 564 SyntacticMatches, 20 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=450, Invalid=1442, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:55:10,847 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 115 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:10,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 681 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:55:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2025-03-04 10:55:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 2846. [2025-03-04 10:55:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2443 states have (on average 1.1780597625869833) internal successors, (2878), 2456 states have internal predecessors, (2878), 370 states have call successors, (370), 20 states have call predecessors, (370), 20 states have return successors, (370), 369 states have call predecessors, (370), 370 states have call successors, (370) [2025-03-04 10:55:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 3618 transitions. [2025-03-04 10:55:11,244 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 3618 transitions. Word has length 292 [2025-03-04 10:55:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:11,244 INFO L471 AbstractCegarLoop]: Abstraction has 2846 states and 3618 transitions. [2025-03-04 10:55:11,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.5) internal successors, (187), 22 states have internal predecessors, (187), 9 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) [2025-03-04 10:55:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3618 transitions. [2025-03-04 10:55:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-04 10:55:11,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:11,246 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:11,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-03-04 10:55:11,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:11,447 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:55:11,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:11,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1830555824, now seen corresponding path program 1 times [2025-03-04 10:55:11,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:11,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560818292] [2025-03-04 10:55:11,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:11,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:11,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-04 10:55:11,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-04 10:55:11,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:11,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1781 backedges. 10 proven. 367 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-04 10:55:11,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:11,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560818292] [2025-03-04 10:55:11,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560818292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:11,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278141739] [2025-03-04 10:55:11,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:11,743 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:55:11,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-03-04 10:55:11,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-04 10:55:11,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-04 10:55:11,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:11,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:11,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:55:11,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1781 backedges. 10 proven. 1631 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-04 10:55:12,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1781 backedges. 10 proven. 367 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-04 10:55:12,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278141739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:12,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:12,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 25 [2025-03-04 10:55:12,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875504179] [2025-03-04 10:55:12,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:12,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:55:12,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:12,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:55:12,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:55:12,311 INFO L87 Difference]: Start difference. First operand 2846 states and 3618 transitions. Second operand has 25 states, 25 states have (on average 10.44) internal successors, (261), 25 states have internal predecessors, (261), 9 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) [2025-03-04 10:55:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:12,939 INFO L93 Difference]: Finished difference Result 4663 states and 5970 transitions. [2025-03-04 10:55:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 10:55:12,939 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 25 states have internal predecessors, (261), 9 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) Word has length 294 [2025-03-04 10:55:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:12,944 INFO L225 Difference]: With dead ends: 4663 [2025-03-04 10:55:12,944 INFO L226 Difference]: Without dead ends: 2811 [2025-03-04 10:55:12,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 570 SyntacticMatches, 13 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=550, Invalid=1706, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:55:12,947 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 127 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:12,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 783 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:55:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2025-03-04 10:55:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2796. [2025-03-04 10:55:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2796 states, 2397 states have (on average 1.1731330830204423) internal successors, (2812), 2410 states have internal predecessors, (2812), 361 states have call successors, (361), 25 states have call predecessors, (361), 25 states have return successors, (361), 360 states have call predecessors, (361), 361 states have call successors, (361) [2025-03-04 10:55:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 3534 transitions. [2025-03-04 10:55:13,288 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 3534 transitions. Word has length 294 [2025-03-04 10:55:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:13,288 INFO L471 AbstractCegarLoop]: Abstraction has 2796 states and 3534 transitions. [2025-03-04 10:55:13,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.44) internal successors, (261), 25 states have internal predecessors, (261), 9 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 9 states have call predecessors, (66), 9 states have call successors, (66) [2025-03-04 10:55:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3534 transitions. [2025-03-04 10:55:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-04 10:55:13,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:13,290 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:13,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-03-04 10:55:13,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:13,494 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:55:13,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1800512088, now seen corresponding path program 1 times [2025-03-04 10:55:13,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:13,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481173751] [2025-03-04 10:55:13,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:13,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:13,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-04 10:55:13,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-04 10:55:13,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:13,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 20 proven. 361 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-04 10:55:13,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481173751] [2025-03-04 10:55:13,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481173751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:13,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887185302] [2025-03-04 10:55:13,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:13,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:13,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:13,840 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:55:13,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-03-04 10:55:13,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-04 10:55:13,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-04 10:55:13,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:13,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:13,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:55:13,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 20 proven. 1741 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-04 10:55:14,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 20 proven. 361 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-04 10:55:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887185302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:14,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 22 [2025-03-04 10:55:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755984722] [2025-03-04 10:55:14,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:14,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:55:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:14,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:55:14,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:55:14,403 INFO L87 Difference]: Start difference. First operand 2796 states and 3534 transitions. Second operand has 22 states, 22 states have (on average 9.045454545454545) internal successors, (199), 22 states have internal predecessors, (199), 9 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 9 states have call predecessors, (56), 9 states have call successors, (56) [2025-03-04 10:55:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:14,990 INFO L93 Difference]: Finished difference Result 2875 states and 3620 transitions. [2025-03-04 10:55:14,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:55:14,991 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.045454545454545) internal successors, (199), 22 states have internal predecessors, (199), 9 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 9 states have call predecessors, (56), 9 states have call successors, (56) Word has length 309 [2025-03-04 10:55:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:14,995 INFO L225 Difference]: With dead ends: 2875 [2025-03-04 10:55:14,995 INFO L226 Difference]: Without dead ends: 2774 [2025-03-04 10:55:14,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 598 SyntacticMatches, 20 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=462, Invalid=1430, Unknown=0, NotChecked=0, Total=1892 [2025-03-04 10:55:14,996 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 121 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:14,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 706 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:55:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2025-03-04 10:55:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2774. [2025-03-04 10:55:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2377 states have (on average 1.1720656289440472) internal successors, (2786), 2390 states have internal predecessors, (2786), 358 states have call successors, (358), 26 states have call predecessors, (358), 26 states have return successors, (358), 357 states have call predecessors, (358), 358 states have call successors, (358) [2025-03-04 10:55:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3502 transitions. [2025-03-04 10:55:15,323 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3502 transitions. Word has length 309 [2025-03-04 10:55:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:15,323 INFO L471 AbstractCegarLoop]: Abstraction has 2774 states and 3502 transitions. [2025-03-04 10:55:15,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.045454545454545) internal successors, (199), 22 states have internal predecessors, (199), 9 states have call successors, (56), 10 states have call predecessors, (56), 10 states have return successors, (56), 9 states have call predecessors, (56), 9 states have call successors, (56) [2025-03-04 10:55:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3502 transitions. [2025-03-04 10:55:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-04 10:55:15,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:15,325 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:55:15,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-03-04 10:55:15,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-03-04 10:55:15,526 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:55:15,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash 224403645, now seen corresponding path program 2 times [2025-03-04 10:55:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:15,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555895558] [2025-03-04 10:55:15,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:55:15,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:15,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 318 statements into 2 equivalence classes. [2025-03-04 10:55:15,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 318 of 318 statements. [2025-03-04 10:55:15,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:55:15,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 2101 trivial. 0 not checked. [2025-03-04 10:55:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555895558] [2025-03-04 10:55:15,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555895558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:15,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:15,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:55:15,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536011021] [2025-03-04 10:55:15,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:15,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:55:15,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:15,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:55:15,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:55:15,672 INFO L87 Difference]: Start difference. First operand 2774 states and 3502 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 10:55:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:16,039 INFO L93 Difference]: Finished difference Result 2777 states and 3502 transitions. [2025-03-04 10:55:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:55:16,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 318 [2025-03-04 10:55:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:16,045 INFO L225 Difference]: With dead ends: 2777 [2025-03-04 10:55:16,045 INFO L226 Difference]: Without dead ends: 2776 [2025-03-04 10:55:16,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:55:16,046 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 33 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:16,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 238 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2025-03-04 10:55:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2774. [2025-03-04 10:55:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2377 states have (on average 1.1649137568363483) internal successors, (2769), 2390 states have internal predecessors, (2769), 358 states have call successors, (358), 26 states have call predecessors, (358), 26 states have return successors, (358), 357 states have call predecessors, (358), 358 states have call successors, (358) [2025-03-04 10:55:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3485 transitions. [2025-03-04 10:55:16,415 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3485 transitions. Word has length 318 [2025-03-04 10:55:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:16,415 INFO L471 AbstractCegarLoop]: Abstraction has 2774 states and 3485 transitions. [2025-03-04 10:55:16,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 10:55:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3485 transitions. [2025-03-04 10:55:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-04 10:55:16,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:16,417 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:16,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-04 10:55:16,418 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 31 more)] === [2025-03-04 10:55:16,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2055039464, now seen corresponding path program 3 times [2025-03-04 10:55:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606415869] [2025-03-04 10:55:16,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:55:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:16,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 321 statements into 16 equivalence classes. [2025-03-04 10:55:16,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 272 of 321 statements. [2025-03-04 10:55:16,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-04 10:55:16,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2191 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-04 10:55:16,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:16,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606415869] [2025-03-04 10:55:16,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606415869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153648015] [2025-03-04 10:55:16,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:55:16,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:16,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:16,957 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:55:16,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-03-04 10:55:16,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 321 statements into 16 equivalence classes. [2025-03-04 10:55:17,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 89 of 321 statements. [2025-03-04 10:55:17,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:55:17,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:17,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 10:55:17,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2191 backedges. 298 proven. 306 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked. [2025-03-04 10:55:18,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153648015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:19,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:55:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17] total 43 [2025-03-04 10:55:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109753353] [2025-03-04 10:55:19,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:19,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 10:55:19,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:19,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 10:55:19,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2003, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:55:19,221 INFO L87 Difference]: Start difference. First operand 2774 states and 3485 transitions. Second operand has 43 states, 42 states have (on average 6.380952380952381) internal successors, (268), 42 states have internal predecessors, (268), 14 states have call successors, (44), 1 states have call predecessors, (44), 2 states have return successors, (45), 14 states have call predecessors, (45), 14 states have call successors, (45) [2025-03-04 10:55:29,663 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]