./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:40:48,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:40:48,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:40:48,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:40:48,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:40:49,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:40:49,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:40:49,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:40:49,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:40:49,025 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:40:49,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:40:49,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:40:49,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:40:49,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:40:49,026 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:40:49,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:40:49,027 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:40:49,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:40:49,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:40:49,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:40:49,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:40:49,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:40:49,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:40:49,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:40:49,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:40:49,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:40:49,029 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 -> 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b [2025-03-17 15:40:49,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:40:49,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:40:49,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:40:49,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:40:49,237 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:40:49,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2025-03-17 15:40:50,339 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ba29203/08a25adb423a41519d840a5aefdf1a61/FLAGf36afe58f [2025-03-17 15:40:50,522 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:40:50,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2025-03-17 15:40:50,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ba29203/08a25adb423a41519d840a5aefdf1a61/FLAGf36afe58f [2025-03-17 15:40:50,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ba29203/08a25adb423a41519d840a5aefdf1a61 [2025-03-17 15:40:50,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:40:50,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:40:50,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:40:50,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:40:50,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:40:50,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:40:50" (1/1) ... [2025-03-17 15:40:50,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30490454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:50, skipping insertion in model container [2025-03-17 15:40:50,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:40:50" (1/1) ... [2025-03-17 15:40:50,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:40:51,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:40:51,007 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:40:51,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:40:51,027 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:40:51,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51 WrapperNode [2025-03-17 15:40:51,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:40:51,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:40:51,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:40:51,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:40:51,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,050 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-03-17 15:40:51,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:40:51,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:40:51,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:40:51,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:40:51,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,076 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:40:51,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:40:51,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:40:51,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:40:51,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:40:51,083 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (1/1) ... [2025-03-17 15:40:51,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:40:51,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:40:51,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:40:51,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:40:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:40:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:40:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:40:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:40:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:40:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:40:51,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:40:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:40:51,166 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:40:51,168 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:40:51,594 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-17 15:40:51,594 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:40:51,608 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:40:51,608 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:40:51,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:40:51 BoogieIcfgContainer [2025-03-17 15:40:51,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:40:51,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:40:51,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:40:51,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:40:51,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:40:50" (1/3) ... [2025-03-17 15:40:51,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9e4dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:40:51, skipping insertion in model container [2025-03-17 15:40:51,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:40:51" (2/3) ... [2025-03-17 15:40:51,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9e4dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:40:51, skipping insertion in model container [2025-03-17 15:40:51,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:40:51" (3/3) ... [2025-03-17 15:40:51,614 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2025-03-17 15:40:51,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:40:51,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll_valuebound10.c that has 3 procedures, 223 locations, 1 initial locations, 1 loop locations, and 102 error locations. [2025-03-17 15:40:51,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:40:51,676 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;@77cb7b8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:40:51,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-03-17 15:40:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 113 states have (on average 1.9380530973451326) internal successors, (219), 215 states have internal predecessors, (219), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:40:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:40:51,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:51,685 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:40:51,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:51,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:51,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1900273073, now seen corresponding path program 1 times [2025-03-17 15:40:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:51,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424736885] [2025-03-17 15:40:51,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:51,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:40:51,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:40:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:40:51,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424736885] [2025-03-17 15:40:51,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424736885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:40:51,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500439161] [2025-03-17 15:40:51,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:51,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:40:51,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:40:51,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:40:51,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:40:51,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:40:51,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:40:51,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:51,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:51,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 15:40:51,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:40:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:40:51,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:40:51,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500439161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:40:51,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:40:51,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 15:40:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508190294] [2025-03-17 15:40:51,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:40:51,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:40:51,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:51,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:40:51,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:40:51,851 INFO L87 Difference]: Start difference. First operand has 223 states, 113 states have (on average 1.9380530973451326) internal successors, (219), 215 states have internal predecessors, (219), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:40:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:40:51,880 INFO L93 Difference]: Finished difference Result 419 states and 460 transitions. [2025-03-17 15:40:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:40:51,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2025-03-17 15:40:51,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:40:51,886 INFO L225 Difference]: With dead ends: 419 [2025-03-17 15:40:51,887 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 15:40:51,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-17 15:40:51,894 INFO L435 NwaCegarLoop]: 201 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, 201 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-17 15:40:51,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:40:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 15:40:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-17 15:40:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 111 states have (on average 1.6936936936936937) internal successors, (188), 187 states have internal predecessors, (188), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 15:40:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 196 transitions. [2025-03-17 15:40:51,940 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 196 transitions. Word has length 13 [2025-03-17 15:40:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:40:51,940 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 196 transitions. [2025-03-17 15:40:51,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:40:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2025-03-17 15:40:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:40:51,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:51,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:40:51,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:40:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 15:40:52,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2095863057, now seen corresponding path program 1 times [2025-03-17 15:40:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530060026] [2025-03-17 15:40:52,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:52,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:40:52,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:40:52,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:52,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:52,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:52,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530060026] [2025-03-17 15:40:52,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530060026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:40:52,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:40:52,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:40:52,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109005291] [2025-03-17 15:40:52,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:40:52,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:40:52,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:52,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:40:52,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:40:52,205 INFO L87 Difference]: Start difference. First operand 194 states and 196 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 15:40:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:40:52,596 INFO L93 Difference]: Finished difference Result 354 states and 362 transitions. [2025-03-17 15:40:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:40:52,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 13 [2025-03-17 15:40:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:40:52,598 INFO L225 Difference]: With dead ends: 354 [2025-03-17 15:40:52,599 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 15:40:52,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:40:52,599 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:40:52,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 135 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:40:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 15:40:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 284. [2025-03-17 15:40:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 200 states have (on average 1.435) internal successors, (287), 276 states have internal predecessors, (287), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:40:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 297 transitions. [2025-03-17 15:40:52,615 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 297 transitions. Word has length 13 [2025-03-17 15:40:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:40:52,615 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 297 transitions. [2025-03-17 15:40:52,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 15:40:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 297 transitions. [2025-03-17 15:40:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 15:40:52,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:52,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:40:52,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:40:52,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:52,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2066429559, now seen corresponding path program 1 times [2025-03-17 15:40:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:52,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009733525] [2025-03-17 15:40:52,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:52,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:40:52,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:40:52,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:52,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:52,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:52,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009733525] [2025-03-17 15:40:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009733525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:40:52,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:40:52,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:40:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449389089] [2025-03-17 15:40:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:40:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:40:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:52,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:40:52,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:40:52,733 INFO L87 Difference]: Start difference. First operand 284 states and 297 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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-17 15:40:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:40:52,789 INFO L93 Difference]: Finished difference Result 308 states and 315 transitions. [2025-03-17 15:40:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:40:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 51 [2025-03-17 15:40:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:40:52,791 INFO L225 Difference]: With dead ends: 308 [2025-03-17 15:40:52,791 INFO L226 Difference]: Without dead ends: 301 [2025-03-17 15:40:52,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:40:52,792 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 68 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:40:52,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 357 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:40:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-17 15:40:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 283. [2025-03-17 15:40:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 199 states have (on average 1.407035175879397) internal successors, (280), 275 states have internal predecessors, (280), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:40:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 290 transitions. [2025-03-17 15:40:52,806 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 290 transitions. Word has length 51 [2025-03-17 15:40:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:40:52,806 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 290 transitions. [2025-03-17 15:40:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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-17 15:40:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 290 transitions. [2025-03-17 15:40:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 15:40:52,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:52,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:40:52,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:40:52,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:52,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:52,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1563912249, now seen corresponding path program 1 times [2025-03-17 15:40:52,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:52,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322466529] [2025-03-17 15:40:52,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:52,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:52,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 15:40:52,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 15:40:52,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:52,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:52,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322466529] [2025-03-17 15:40:52,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322466529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:40:52,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:40:52,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:40:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437941318] [2025-03-17 15:40:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:40:52,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:40:52,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:52,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:40:52,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:40:52,895 INFO L87 Difference]: Start difference. First operand 283 states and 290 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-17 15:40:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:40:53,045 INFO L93 Difference]: Finished difference Result 303 states and 308 transitions. [2025-03-17 15:40:53,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:40:53,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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 53 [2025-03-17 15:40:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:40:53,047 INFO L225 Difference]: With dead ends: 303 [2025-03-17 15:40:53,047 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 15:40:53,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:40:53,048 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 150 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:40:53,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 282 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:40:53,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 15:40:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 242. [2025-03-17 15:40:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 158 states have (on average 1.5) internal successors, (237), 234 states have internal predecessors, (237), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:40:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 247 transitions. [2025-03-17 15:40:53,062 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 247 transitions. Word has length 53 [2025-03-17 15:40:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:40:53,062 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 247 transitions. [2025-03-17 15:40:53,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-17 15:40:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 247 transitions. [2025-03-17 15:40:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 15:40:53,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:53,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:40:53,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:40:53,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:53,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash 712457103, now seen corresponding path program 1 times [2025-03-17 15:40:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:53,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293346052] [2025-03-17 15:40:53,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:53,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:53,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 15:40:53,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 15:40:53,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:53,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:53,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:53,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293346052] [2025-03-17 15:40:53,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293346052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:40:53,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:40:53,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:40:53,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773720719] [2025-03-17 15:40:53,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:40:53,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:40:53,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:53,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:40:53,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:40:53,138 INFO L87 Difference]: Start difference. First operand 242 states and 247 transitions. Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:40:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:40:53,168 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2025-03-17 15:40:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:40:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 61 [2025-03-17 15:40:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:40:53,170 INFO L225 Difference]: With dead ends: 244 [2025-03-17 15:40:53,170 INFO L226 Difference]: Without dead ends: 242 [2025-03-17 15:40:53,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:40:53,170 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:40:53,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:40:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-17 15:40:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-03-17 15:40:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 158 states have (on average 1.4873417721518987) internal successors, (235), 234 states have internal predecessors, (235), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:40:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 245 transitions. [2025-03-17 15:40:53,186 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 245 transitions. Word has length 61 [2025-03-17 15:40:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:40:53,186 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 245 transitions. [2025-03-17 15:40:53,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:40:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 245 transitions. [2025-03-17 15:40:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:40:53,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:53,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:40:53,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:40:53,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1860806502, now seen corresponding path program 1 times [2025-03-17 15:40:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295379350] [2025-03-17 15:40:53,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:53,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:40:53,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:40:53,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:53,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:40:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113835857] [2025-03-17 15:40:53,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:40:53,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:40:53,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:40:53,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:40:53,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:40:53,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:40:53,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:53,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:53,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:40:53,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:40:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:53,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:40:53,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295379350] [2025-03-17 15:40:53,334 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:40:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113835857] [2025-03-17 15:40:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113835857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:40:53,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:40:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:40:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342644659] [2025-03-17 15:40:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:40:53,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:40:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:53,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:40:53,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:40:53,336 INFO L87 Difference]: Start difference. First operand 242 states and 245 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:40:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:40:53,691 INFO L93 Difference]: Finished difference Result 416 states and 429 transitions. [2025-03-17 15:40:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:40:53,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2025-03-17 15:40:53,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:40:53,693 INFO L225 Difference]: With dead ends: 416 [2025-03-17 15:40:53,693 INFO L226 Difference]: Without dead ends: 351 [2025-03-17 15:40:53,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:40:53,693 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:40:53,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 155 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:40:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-17 15:40:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 345. [2025-03-17 15:40:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 259 states have (on average 1.3513513513513513) internal successors, (350), 335 states have internal predecessors, (350), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:40:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 364 transitions. [2025-03-17 15:40:53,700 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 364 transitions. Word has length 66 [2025-03-17 15:40:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:40:53,700 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 364 transitions. [2025-03-17 15:40:53,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:40:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 364 transitions. [2025-03-17 15:40:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 15:40:53,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:53,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:40:53,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:40:53,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 15:40:53,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:53,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash -878121021, now seen corresponding path program 1 times [2025-03-17 15:40:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:53,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685446831] [2025-03-17 15:40:53,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:53,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 15:40:53,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 15:40:53,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:53,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:53,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685446831] [2025-03-17 15:40:53,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685446831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:40:53,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:40:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:40:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021644681] [2025-03-17 15:40:53,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:40:53,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:40:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:53,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:40:53,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:40:53,974 INFO L87 Difference]: Start difference. First operand 345 states and 364 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:40:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:40:54,213 INFO L93 Difference]: Finished difference Result 346 states and 364 transitions. [2025-03-17 15:40:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:40:54,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 73 [2025-03-17 15:40:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:40:54,215 INFO L225 Difference]: With dead ends: 346 [2025-03-17 15:40:54,215 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 15:40:54,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:40:54,215 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 53 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:40:54,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 335 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:40:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 15:40:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 15:40:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 259 states have (on average 1.3474903474903475) internal successors, (349), 335 states have internal predecessors, (349), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:40:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 363 transitions. [2025-03-17 15:40:54,222 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 363 transitions. Word has length 73 [2025-03-17 15:40:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:40:54,222 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 363 transitions. [2025-03-17 15:40:54,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:40:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 363 transitions. [2025-03-17 15:40:54,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 15:40:54,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:54,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:40:54,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:40:54,223 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:54,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1451947810, now seen corresponding path program 1 times [2025-03-17 15:40:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:54,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629035835] [2025-03-17 15:40:54,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:54,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:54,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:40:54,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:40:54,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:54,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:54,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629035835] [2025-03-17 15:40:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629035835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:40:54,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:40:54,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:40:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520113435] [2025-03-17 15:40:54,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:40:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:40:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:54,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:40:54,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:40:54,298 INFO L87 Difference]: Start difference. First operand 345 states and 363 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:40:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:40:54,366 INFO L93 Difference]: Finished difference Result 346 states and 363 transitions. [2025-03-17 15:40:54,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:40:54,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2025-03-17 15:40:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:40:54,367 INFO L225 Difference]: With dead ends: 346 [2025-03-17 15:40:54,367 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 15:40:54,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:40:54,368 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 46 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:40:54,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 324 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:40:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 15:40:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-17 15:40:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 259 states have (on average 1.3436293436293436) internal successors, (348), 335 states have internal predecessors, (348), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:40:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 362 transitions. [2025-03-17 15:40:54,375 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 362 transitions. Word has length 74 [2025-03-17 15:40:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:40:54,375 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 362 transitions. [2025-03-17 15:40:54,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 15:40:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 362 transitions. [2025-03-17 15:40:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 15:40:54,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:54,376 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-17 15:40:54,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:40:54,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:54,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash 654216814, now seen corresponding path program 1 times [2025-03-17 15:40:54,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:54,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305359743] [2025-03-17 15:40:54,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:54,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 15:40:54,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 15:40:54,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:54,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:40:54,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [414438109] [2025-03-17 15:40:54,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:54,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:40:54,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:40:54,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:40:54,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:40:54,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 15:40:54,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 15:40:54,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:54,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:54,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:40:54,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:40:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:54,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:40:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:54,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:54,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305359743] [2025-03-17 15:40:54,853 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:40:54,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414438109] [2025-03-17 15:40:54,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414438109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:40:54,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:40:54,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-17 15:40:54,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361650188] [2025-03-17 15:40:54,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:40:54,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:40:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:54,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:40:54,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:40:54,854 INFO L87 Difference]: Start difference. First operand 345 states and 362 transitions. Second operand has 8 states, 7 states have (on average 28.714285714285715) internal successors, (201), 8 states have internal predecessors, (201), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:40:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:40:56,045 INFO L93 Difference]: Finished difference Result 369 states and 380 transitions. [2025-03-17 15:40:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:40:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 28.714285714285715) internal successors, (201), 8 states have internal predecessors, (201), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 113 [2025-03-17 15:40:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:40:56,047 INFO L225 Difference]: With dead ends: 369 [2025-03-17 15:40:56,047 INFO L226 Difference]: Without dead ends: 360 [2025-03-17 15:40:56,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:40:56,048 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 341 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:40:56,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 173 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 15:40:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-17 15:40:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 349. [2025-03-17 15:40:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 266 states have (on average 1.3120300751879699) internal successors, (349), 339 states have internal predecessors, (349), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:40:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 363 transitions. [2025-03-17 15:40:56,057 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 363 transitions. Word has length 113 [2025-03-17 15:40:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:40:56,058 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 363 transitions. [2025-03-17 15:40:56,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 28.714285714285715) internal successors, (201), 8 states have internal predecessors, (201), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:40:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 363 transitions. [2025-03-17 15:40:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 15:40:56,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:40:56,059 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-17 15:40:56,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:40:56,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:40:56,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-17 15:40:56,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:40:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1637136236, now seen corresponding path program 1 times [2025-03-17 15:40:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:40:56,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433198962] [2025-03-17 15:40:56,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:56,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:40:56,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 15:40:56,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 15:40:56,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:56,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:40:56,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108538122] [2025-03-17 15:40:56,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:40:56,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:40:56,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:40:56,284 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:40:56,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:40:56,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 15:40:56,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 15:40:56,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:40:56,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:40:56,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:40:56,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:40:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:56,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:40:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:40:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:40:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433198962] [2025-03-17 15:40:57,435 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:40:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108538122] [2025-03-17 15:40:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108538122] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:40:57,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 15:40:57,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-17 15:40:57,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652738126] [2025-03-17 15:40:57,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 15:40:57,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:40:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:40:57,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:40:57,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:40:57,436 INFO L87 Difference]: Start difference. First operand 349 states and 363 transitions. Second operand has 9 states, 8 states have (on average 25.625) internal successors, (205), 9 states have internal predecessors, (205), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 15:41:04,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.93s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:07,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:13,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:15,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:25,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:27,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:33,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.94s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:39,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.96s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:40,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:45,910 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 [] [2025-03-17 15:41:50,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:54,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.94s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:41:58,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:02,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:03,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:09,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:15,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:18,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:26,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:30,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 15:42:36,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []