./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/fermat1-ll_unwindbound2.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 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:09:56,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:09:56,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:09:56,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:09:56,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:09:57,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:09:57,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:09:57,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:09:57,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:09:57,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:09:57,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:09:57,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:09:57,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:09:57,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:09:57,037 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:09:57,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:09:57,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:09:57,039 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:09:57,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:09:57,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:09:57,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:09:57,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:09:57,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:09:57,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:09:57,044 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:09:57,060 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:09:57,061 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:09:57,061 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:09:57,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:09:57,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:09:57,062 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:09:57,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:09:57,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:09:57,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:09:57,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:09:57,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:09:57,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:09:57,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:09:57,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:09:57,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:09:57,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:09:57,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:09:57,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:09:57,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:09:57,065 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 [2024-11-10 19:09:57,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:09:57,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:09:57,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:09:57,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:09:57,359 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:09:57,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2024-11-10 19:09:58,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:09:58,998 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:09:58,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2024-11-10 19:09:59,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5349a878/be77ff40a18a44ba94c197691240d71e/FLAG6ad132ec3 [2024-11-10 19:09:59,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5349a878/be77ff40a18a44ba94c197691240d71e [2024-11-10 19:09:59,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:09:59,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:09:59,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:09:59,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:09:59,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:09:59,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d2bd240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59, skipping insertion in model container [2024-11-10 19:09:59,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:09:59,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:09:59,247 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:09:59,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:09:59,288 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:09:59,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59 WrapperNode [2024-11-10 19:09:59,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:09:59,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:09:59,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:09:59,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:09:59,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,335 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2024-11-10 19:09:59,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:09:59,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:09:59,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:09:59,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:09:59,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,370 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]. [2024-11-10 19:09:59,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:09:59,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:09:59,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:09:59,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:09:59,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (1/1) ... [2024-11-10 19:09:59,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:09:59,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:09:59,433 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) [2024-11-10 19:09:59,439 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 [2024-11-10 19:09:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:09:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 19:09:59,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 19:09:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:09:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:09:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:09:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 19:09:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 19:09:59,618 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:09:59,625 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:10:00,135 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-10 19:10:00,136 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:10:00,159 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:10:00,159 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:10:00,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:10:00 BoogieIcfgContainer [2024-11-10 19:10:00,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:10:00,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:10:00,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:10:00,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:10:00,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:09:59" (1/3) ... [2024-11-10 19:10:00,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4c5a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:10:00, skipping insertion in model container [2024-11-10 19:10:00,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:59" (2/3) ... [2024-11-10 19:10:00,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4c5a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:10:00, skipping insertion in model container [2024-11-10 19:10:00,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:10:00" (3/3) ... [2024-11-10 19:10:00,171 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound2.c [2024-11-10 19:10:00,187 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:10:00,188 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 98 error locations. [2024-11-10 19:10:00,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:10:00,263 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;@30490dfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:10:00,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2024-11-10 19:10:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 129 states have (on average 1.8449612403100775) internal successors, (238), 227 states have internal predecessors, (238), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 19:10:00,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:00,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 19:10:00,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash 261127, now seen corresponding path program 1 times [2024-11-10 19:10:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:00,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977638693] [2024-11-10 19:10:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:00,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:10:00,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:00,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977638693] [2024-11-10 19:10:00,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977638693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:00,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:00,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645355759] [2024-11-10 19:10:00,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:00,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:00,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:00,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:00,490 INFO L87 Difference]: Start difference. First operand has 236 states, 129 states have (on average 1.8449612403100775) internal successors, (238), 227 states have internal predecessors, (238), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:10:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:00,602 INFO L93 Difference]: Finished difference Result 445 states and 489 transitions. [2024-11-10 19:10:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 19:10:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:00,615 INFO L225 Difference]: With dead ends: 445 [2024-11-10 19:10:00,615 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 19:10:00,621 INFO L431 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 [2024-11-10 19:10:00,625 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 15 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:00,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 408 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 19:10:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-10 19:10:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 124 states have (on average 1.717741935483871) internal successors, (213), 207 states have internal predecessors, (213), 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) [2024-11-10 19:10:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 223 transitions. [2024-11-10 19:10:00,678 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 223 transitions. Word has length 3 [2024-11-10 19:10:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:00,679 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 223 transitions. [2024-11-10 19:10:00,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:10:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 223 transitions. [2024-11-10 19:10:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 19:10:00,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:00,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 19:10:00,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:10:00,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:00,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 8095135, now seen corresponding path program 1 times [2024-11-10 19:10:00,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:00,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389453026] [2024-11-10 19:10:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:00,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:10:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389453026] [2024-11-10 19:10:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389453026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:00,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:00,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269390252] [2024-11-10 19:10:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:00,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:00,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:00,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:00,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:00,722 INFO L87 Difference]: Start difference. First operand 215 states and 223 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:10:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:00,788 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2024-11-10 19:10:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:00,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-10 19:10:00,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:00,795 INFO L225 Difference]: With dead ends: 215 [2024-11-10 19:10:00,795 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 19:10:00,795 INFO L431 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 [2024-11-10 19:10:00,796 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 14 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:00,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 395 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 19:10:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-10 19:10:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 124 states have (on average 1.685483870967742) internal successors, (209), 203 states have internal predecessors, (209), 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) [2024-11-10 19:10:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 219 transitions. [2024-11-10 19:10:00,822 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 219 transitions. Word has length 4 [2024-11-10 19:10:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:00,822 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 219 transitions. [2024-11-10 19:10:00,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:10:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 219 transitions. [2024-11-10 19:10:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 19:10:00,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:00,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:00,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:10:00,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:00,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:00,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1504860389, now seen corresponding path program 1 times [2024-11-10 19:10:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:00,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199306130] [2024-11-10 19:10:00,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:00,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810237697] [2024-11-10 19:10:00,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:00,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:00,857 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) [2024-11-10 19:10:00,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:10:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:00,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 19:10:00,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:10:00,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:00,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:00,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199306130] [2024-11-10 19:10:00,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:00,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810237697] [2024-11-10 19:10:00,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810237697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:00,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:00,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:00,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049963705] [2024-11-10 19:10:00,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:00,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:00,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:00,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:00,981 INFO L87 Difference]: Start difference. First operand 211 states and 219 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:10:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:01,021 INFO L93 Difference]: Finished difference Result 211 states and 219 transitions. [2024-11-10 19:10:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:01,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 19:10:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:01,026 INFO L225 Difference]: With dead ends: 211 [2024-11-10 19:10:01,026 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 19:10:01,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:01,030 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 10 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:01,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 395 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 19:10:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-10 19:10:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 124 states have (on average 1.6693548387096775) internal successors, (207), 201 states have internal predecessors, (207), 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) [2024-11-10 19:10:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 217 transitions. [2024-11-10 19:10:01,041 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 217 transitions. Word has length 8 [2024-11-10 19:10:01,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:01,041 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 217 transitions. [2024-11-10 19:10:01,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:10:01,041 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 217 transitions. [2024-11-10 19:10:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 19:10:01,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:01,043 INFO L215 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] [2024-11-10 19:10:01,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 19:10:01,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:01,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:01,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash 286219215, now seen corresponding path program 1 times [2024-11-10 19:10:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450493277] [2024-11-10 19:10:01,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:01,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334539602] [2024-11-10 19:10:01,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:01,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:01,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:01,304 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) [2024-11-10 19:10:01,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 19:10:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:01,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 19:10:01,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:01,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:01,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:01,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450493277] [2024-11-10 19:10:01,406 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:01,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334539602] [2024-11-10 19:10:01,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334539602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884091707] [2024-11-10 19:10:01,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:01,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:01,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:01,409 INFO L87 Difference]: Start difference. First operand 209 states and 217 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-10 19:10:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:01,473 INFO L93 Difference]: Finished difference Result 209 states and 217 transitions. [2024-11-10 19:10:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:01,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 26 [2024-11-10 19:10:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:01,476 INFO L225 Difference]: With dead ends: 209 [2024-11-10 19:10:01,476 INFO L226 Difference]: Without dead ends: 207 [2024-11-10 19:10:01,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:01,477 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 170 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:01,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 196 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-10 19:10:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-10 19:10:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 124 states have (on average 1.653225806451613) internal successors, (205), 199 states have internal predecessors, (205), 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) [2024-11-10 19:10:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 215 transitions. [2024-11-10 19:10:01,505 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 215 transitions. Word has length 26 [2024-11-10 19:10:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:01,506 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 215 transitions. [2024-11-10 19:10:01,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-10 19:10:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 215 transitions. [2024-11-10 19:10:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 19:10:01,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:01,507 INFO L215 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] [2024-11-10 19:10:01,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 19:10:01,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 19:10:01,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:01,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash 282861244, now seen corresponding path program 1 times [2024-11-10 19:10:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:01,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491215946] [2024-11-10 19:10:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:01,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:02,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:02,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491215946] [2024-11-10 19:10:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491215946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615915265] [2024-11-10 19:10:02,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:02,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:02,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:02,026 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) [2024-11-10 19:10:02,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 19:10:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:02,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:10:02,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:02,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:02,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615915265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:02,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:10:02,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 19:10:02,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800505353] [2024-11-10 19:10:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:02,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:10:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:10:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:02,516 INFO L87 Difference]: Start difference. First operand 207 states and 215 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:02,641 INFO L93 Difference]: Finished difference Result 207 states and 215 transitions. [2024-11-10 19:10:02,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:10:02,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-10 19:10:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:02,643 INFO L225 Difference]: With dead ends: 207 [2024-11-10 19:10:02,643 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 19:10:02,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:02,644 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 170 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:02,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 706 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 19:10:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-10 19:10:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 124 states have (on average 1.6370967741935485) internal successors, (203), 197 states have internal predecessors, (203), 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) [2024-11-10 19:10:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 213 transitions. [2024-11-10 19:10:02,653 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 213 transitions. Word has length 27 [2024-11-10 19:10:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:02,654 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 213 transitions. [2024-11-10 19:10:02,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 213 transitions. [2024-11-10 19:10:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 19:10:02,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:02,655 INFO L215 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] [2024-11-10 19:10:02,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 19:10:02,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:02,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:02,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash -6346004, now seen corresponding path program 1 times [2024-11-10 19:10:02,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:02,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025065448] [2024-11-10 19:10:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:02,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:02,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:02,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025065448] [2024-11-10 19:10:02,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025065448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:02,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:02,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325506198] [2024-11-10 19:10:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:02,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:02,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:02,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:02,924 INFO L87 Difference]: Start difference. First operand 205 states and 213 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:02,965 INFO L93 Difference]: Finished difference Result 286 states and 295 transitions. [2024-11-10 19:10:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:10:02,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-10 19:10:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:02,967 INFO L225 Difference]: With dead ends: 286 [2024-11-10 19:10:02,967 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 19:10:02,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:10:02,969 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 87 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:02,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 19:10:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 233. [2024-11-10 19:10:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 150 states have (on average 1.6466666666666667) internal successors, (247), 224 states have internal predecessors, (247), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2024-11-10 19:10:02,988 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 30 [2024-11-10 19:10:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:02,989 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2024-11-10 19:10:02,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2024-11-10 19:10:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 19:10:02,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:02,991 INFO L215 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] [2024-11-10 19:10:02,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 19:10:02,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:02,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash -196725960, now seen corresponding path program 1 times [2024-11-10 19:10:02,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:02,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561628603] [2024-11-10 19:10:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:02,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561628603] [2024-11-10 19:10:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561628603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:03,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:03,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124747545] [2024-11-10 19:10:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:03,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:03,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:03,072 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:03,108 INFO L93 Difference]: Finished difference Result 262 states and 286 transitions. [2024-11-10 19:10:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:10:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-10 19:10:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:03,111 INFO L225 Difference]: With dead ends: 262 [2024-11-10 19:10:03,112 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 19:10:03,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:10:03,113 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 10 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:03,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 593 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 19:10:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-10 19:10:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 150 states have (on average 1.6333333333333333) internal successors, (245), 224 states have internal predecessors, (245), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 257 transitions. [2024-11-10 19:10:03,122 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 257 transitions. Word has length 31 [2024-11-10 19:10:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:03,123 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 257 transitions. [2024-11-10 19:10:03,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 19:10:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 257 transitions. [2024-11-10 19:10:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 19:10:03,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:03,124 INFO L215 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] [2024-11-10 19:10:03,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 19:10:03,125 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1967446504, now seen corresponding path program 1 times [2024-11-10 19:10:03,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:03,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764979512] [2024-11-10 19:10:03,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:03,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:03,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764979512] [2024-11-10 19:10:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764979512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:03,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:03,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:03,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399627330] [2024-11-10 19:10:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:03,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:03,241 INFO L87 Difference]: Start difference. First operand 233 states and 257 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (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) [2024-11-10 19:10:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:03,328 INFO L93 Difference]: Finished difference Result 288 states and 314 transitions. [2024-11-10 19:10:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (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 34 [2024-11-10 19:10:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:03,330 INFO L225 Difference]: With dead ends: 288 [2024-11-10 19:10:03,330 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 19:10:03,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:03,332 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 145 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:03,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 287 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 19:10:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 251. [2024-11-10 19:10:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 283 transitions. [2024-11-10 19:10:03,348 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 283 transitions. Word has length 34 [2024-11-10 19:10:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:03,349 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 283 transitions. [2024-11-10 19:10:03,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (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) [2024-11-10 19:10:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 283 transitions. [2024-11-10 19:10:03,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 19:10:03,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:03,350 INFO L215 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] [2024-11-10 19:10:03,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 19:10:03,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:03,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:03,351 INFO L85 PathProgramCache]: Analyzing trace with hash 861299637, now seen corresponding path program 1 times [2024-11-10 19:10:03,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:03,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463381283] [2024-11-10 19:10:03,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:03,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:03,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463381283] [2024-11-10 19:10:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463381283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:03,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:03,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299607332] [2024-11-10 19:10:03,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:03,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:03,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:03,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:03,423 INFO L87 Difference]: Start difference. First operand 251 states and 283 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) [2024-11-10 19:10:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:03,566 INFO L93 Difference]: Finished difference Result 291 states and 316 transitions. [2024-11-10 19:10:03,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:10:03,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 35 [2024-11-10 19:10:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:03,569 INFO L225 Difference]: With dead ends: 291 [2024-11-10 19:10:03,570 INFO L226 Difference]: Without dead ends: 288 [2024-11-10 19:10:03,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:03,571 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 156 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:03,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 446 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-10 19:10:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 254. [2024-11-10 19:10:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 245 states have internal predecessors, (273), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2024-11-10 19:10:03,587 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 35 [2024-11-10 19:10:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:03,588 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2024-11-10 19:10:03,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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) [2024-11-10 19:10:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2024-11-10 19:10:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 19:10:03,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:03,591 INFO L215 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] [2024-11-10 19:10:03,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 19:10:03,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:03,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash 930485126, now seen corresponding path program 1 times [2024-11-10 19:10:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:03,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957246155] [2024-11-10 19:10:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:03,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677259735] [2024-11-10 19:10:03,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:03,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:03,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:03,614 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) [2024-11-10 19:10:03,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 19:10:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:03,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 19:10:03,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:03,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:03,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957246155] [2024-11-10 19:10:03,718 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677259735] [2024-11-10 19:10:03,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677259735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:03,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:03,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394445439] [2024-11-10 19:10:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:03,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:03,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:03,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:03,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:03,720 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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) [2024-11-10 19:10:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:03,853 INFO L93 Difference]: Finished difference Result 408 states and 454 transitions. [2024-11-10 19:10:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:03,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 36 [2024-11-10 19:10:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:03,857 INFO L225 Difference]: With dead ends: 408 [2024-11-10 19:10:03,857 INFO L226 Difference]: Without dead ends: 405 [2024-11-10 19:10:03,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:03,858 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 143 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:03,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 374 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-10 19:10:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 329. [2024-11-10 19:10:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 243 states have (on average 1.625514403292181) internal successors, (395), 317 states have internal predecessors, (395), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 19:10:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 413 transitions. [2024-11-10 19:10:03,873 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 413 transitions. Word has length 36 [2024-11-10 19:10:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:03,873 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 413 transitions. [2024-11-10 19:10:03,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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) [2024-11-10 19:10:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 413 transitions. [2024-11-10 19:10:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 19:10:03,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:03,874 INFO L215 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] [2024-11-10 19:10:03,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 19:10:04,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:04,075 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:04,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1219732013, now seen corresponding path program 1 times [2024-11-10 19:10:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839382800] [2024-11-10 19:10:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:04,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839382800] [2024-11-10 19:10:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839382800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482629823] [2024-11-10 19:10:04,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:04,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:04,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:04,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:04,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 19:10:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:04,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:10:04,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:04,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:04,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482629823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:04,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:04,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-10 19:10:04,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2930119] [2024-11-10 19:10:04,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:04,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 19:10:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:04,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 19:10:04,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:04,754 INFO L87 Difference]: Start difference. First operand 329 states and 413 transitions. Second operand has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:05,199 INFO L93 Difference]: Finished difference Result 448 states and 489 transitions. [2024-11-10 19:10:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:10:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-10 19:10:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:05,202 INFO L225 Difference]: With dead ends: 448 [2024-11-10 19:10:05,202 INFO L226 Difference]: Without dead ends: 445 [2024-11-10 19:10:05,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-10 19:10:05,204 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 886 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:05,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 1302 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:10:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-10 19:10:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 335. [2024-11-10 19:10:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 249 states have (on average 1.606425702811245) internal successors, (400), 323 states have internal predecessors, (400), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 19:10:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 418 transitions. [2024-11-10 19:10:05,228 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 418 transitions. Word has length 37 [2024-11-10 19:10:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:05,228 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 418 transitions. [2024-11-10 19:10:05,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 14 states have internal predecessors, (87), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 19:10:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 418 transitions. [2024-11-10 19:10:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 19:10:05,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:05,230 INFO L215 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] [2024-11-10 19:10:05,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 19:10:05,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 19:10:05,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:05,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash 363612145, now seen corresponding path program 1 times [2024-11-10 19:10:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:05,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095853621] [2024-11-10 19:10:05,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:05,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984189572] [2024-11-10 19:10:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:05,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:05,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:05,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:05,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 19:10:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:05,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:10:05,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 19:10:05,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:05,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095853621] [2024-11-10 19:10:05,816 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984189572] [2024-11-10 19:10:05,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984189572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:05,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:10:05,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2024-11-10 19:10:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197585626] [2024-11-10 19:10:05,816 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:05,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:10:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:05,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:10:05,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:10:05,817 INFO L87 Difference]: Start difference. First operand 335 states and 418 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:08,568 INFO L93 Difference]: Finished difference Result 525 states and 642 transitions. [2024-11-10 19:10:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 19:10:08,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-10 19:10:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:08,571 INFO L225 Difference]: With dead ends: 525 [2024-11-10 19:10:08,571 INFO L226 Difference]: Without dead ends: 498 [2024-11-10 19:10:08,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:10:08,572 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 451 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:08,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 545 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 19:10:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-10 19:10:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 463. [2024-11-10 19:10:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 374 states have (on average 1.5133689839572193) internal successors, (566), 448 states have internal predecessors, (566), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-10 19:10:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 590 transitions. [2024-11-10 19:10:08,601 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 590 transitions. Word has length 39 [2024-11-10 19:10:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:08,602 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 590 transitions. [2024-11-10 19:10:08,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:10:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 590 transitions. [2024-11-10 19:10:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 19:10:08,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:08,603 INFO L215 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] [2024-11-10 19:10:08,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 19:10:08,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:08,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:08,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:08,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1538925071, now seen corresponding path program 1 times [2024-11-10 19:10:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:08,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575822683] [2024-11-10 19:10:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:08,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574527487] [2024-11-10 19:10:08,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:08,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:08,817 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:08,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 19:10:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:08,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 19:10:08,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:08,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575822683] [2024-11-10 19:10:08,885 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574527487] [2024-11-10 19:10:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574527487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:08,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:10:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166149190] [2024-11-10 19:10:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:08,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:08,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:08,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:08,887 INFO L87 Difference]: Start difference. First operand 463 states and 590 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-11-10 19:10:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:09,109 INFO L93 Difference]: Finished difference Result 667 states and 835 transitions. [2024-11-10 19:10:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:09,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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 41 [2024-11-10 19:10:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:09,112 INFO L225 Difference]: With dead ends: 667 [2024-11-10 19:10:09,112 INFO L226 Difference]: Without dead ends: 626 [2024-11-10 19:10:09,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:09,114 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 123 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:09,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 320 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:10:09,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-10 19:10:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 592. [2024-11-10 19:10:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 500 states have (on average 1.456) internal successors, (728), 574 states have internal predecessors, (728), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 19:10:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 758 transitions. [2024-11-10 19:10:09,143 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 758 transitions. Word has length 41 [2024-11-10 19:10:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:09,143 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 758 transitions. [2024-11-10 19:10:09,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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) [2024-11-10 19:10:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 758 transitions. [2024-11-10 19:10:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 19:10:09,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:09,146 INFO L215 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] [2024-11-10 19:10:09,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 19:10:09,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:09,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:09,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash -725034534, now seen corresponding path program 1 times [2024-11-10 19:10:09,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:09,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920156561] [2024-11-10 19:10:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:09,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:09,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920156561] [2024-11-10 19:10:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920156561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:09,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:10:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118170231] [2024-11-10 19:10:09,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:09,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:10:09,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:09,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:10:09,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:09,465 INFO L87 Difference]: Start difference. First operand 592 states and 758 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 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) [2024-11-10 19:10:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:09,557 INFO L93 Difference]: Finished difference Result 688 states and 867 transitions. [2024-11-10 19:10:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 19:10:09,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 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 59 [2024-11-10 19:10:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:09,560 INFO L225 Difference]: With dead ends: 688 [2024-11-10 19:10:09,560 INFO L226 Difference]: Without dead ends: 687 [2024-11-10 19:10:09,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:09,561 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 123 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:09,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 796 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-10 19:10:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 658. [2024-11-10 19:10:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 563 states have (on average 1.4440497335701599) internal successors, (813), 636 states have internal predecessors, (813), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 847 transitions. [2024-11-10 19:10:09,595 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 847 transitions. Word has length 59 [2024-11-10 19:10:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:09,596 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 847 transitions. [2024-11-10 19:10:09,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 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) [2024-11-10 19:10:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 847 transitions. [2024-11-10 19:10:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 19:10:09,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:09,597 INFO L215 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] [2024-11-10 19:10:09,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 19:10:09,597 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:09,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1001233958, now seen corresponding path program 1 times [2024-11-10 19:10:09,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:09,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376657043] [2024-11-10 19:10:09,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:09,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:09,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:09,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376657043] [2024-11-10 19:10:09,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376657043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:09,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:09,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:10:09,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238002983] [2024-11-10 19:10:09,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:09,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:10:09,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:09,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:10:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:09,711 INFO L87 Difference]: Start difference. First operand 658 states and 847 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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) [2024-11-10 19:10:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:09,808 INFO L93 Difference]: Finished difference Result 1198 states and 1552 transitions. [2024-11-10 19:10:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:10:09,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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 60 [2024-11-10 19:10:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:09,812 INFO L225 Difference]: With dead ends: 1198 [2024-11-10 19:10:09,812 INFO L226 Difference]: Without dead ends: 658 [2024-11-10 19:10:09,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:09,815 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 18 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:09,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 958 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-10 19:10:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2024-11-10 19:10:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 563 states have (on average 1.4404973357015987) internal successors, (811), 636 states have internal predecessors, (811), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 845 transitions. [2024-11-10 19:10:09,845 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 845 transitions. Word has length 60 [2024-11-10 19:10:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:09,845 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 845 transitions. [2024-11-10 19:10:09,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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) [2024-11-10 19:10:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 845 transitions. [2024-11-10 19:10:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 19:10:09,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:09,846 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:09,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 19:10:09,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:09,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1954930230, now seen corresponding path program 1 times [2024-11-10 19:10:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:09,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109103255] [2024-11-10 19:10:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:09,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109103255] [2024-11-10 19:10:09,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109103255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:09,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:09,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:09,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951736974] [2024-11-10 19:10:09,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:09,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 19:10:09,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:09,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 19:10:09,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:09,942 INFO L87 Difference]: Start difference. First operand 658 states and 845 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:10,176 INFO L93 Difference]: Finished difference Result 694 states and 849 transitions. [2024-11-10 19:10:10,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 19:10:10,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2024-11-10 19:10:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:10,179 INFO L225 Difference]: With dead ends: 694 [2024-11-10 19:10:10,179 INFO L226 Difference]: Without dead ends: 693 [2024-11-10 19:10:10,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 19:10:10,181 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 89 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:10,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 366 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:10:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-10 19:10:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 658. [2024-11-10 19:10:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 563 states have (on average 1.4351687388987566) internal successors, (808), 636 states have internal predecessors, (808), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 19:10:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 842 transitions. [2024-11-10 19:10:10,208 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 842 transitions. Word has length 87 [2024-11-10 19:10:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:10,209 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 842 transitions. [2024-11-10 19:10:10,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 842 transitions. [2024-11-10 19:10:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 19:10:10,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:10,213 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:10,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 19:10:10,213 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash 473293775, now seen corresponding path program 1 times [2024-11-10 19:10:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564134503] [2024-11-10 19:10:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:10,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:10,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564134503] [2024-11-10 19:10:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564134503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:10,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:10:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057642233] [2024-11-10 19:10:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:10:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:10:10,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:10,376 INFO L87 Difference]: Start difference. First operand 658 states and 842 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 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) [2024-11-10 19:10:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:10,511 INFO L93 Difference]: Finished difference Result 859 states and 1072 transitions. [2024-11-10 19:10:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:10:10,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 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 88 [2024-11-10 19:10:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:10,513 INFO L225 Difference]: With dead ends: 859 [2024-11-10 19:10:10,513 INFO L226 Difference]: Without dead ends: 319 [2024-11-10 19:10:10,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-10 19:10:10,515 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 160 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:10,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 590 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-10 19:10:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 258. [2024-11-10 19:10:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 214 states have (on average 1.2289719626168225) internal successors, (263), 246 states have internal predecessors, (263), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:10:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 277 transitions. [2024-11-10 19:10:10,529 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 277 transitions. Word has length 88 [2024-11-10 19:10:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:10,530 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 277 transitions. [2024-11-10 19:10:10,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 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) [2024-11-10 19:10:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 277 transitions. [2024-11-10 19:10:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 19:10:10,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:10,531 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:10,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 19:10:10,532 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:10,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:10,532 INFO L85 PathProgramCache]: Analyzing trace with hash 473295056, now seen corresponding path program 1 times [2024-11-10 19:10:10,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:10,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68399533] [2024-11-10 19:10:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:10,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:10,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68399533] [2024-11-10 19:10:10,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68399533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:10,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:10,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:10:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675202994] [2024-11-10 19:10:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:10,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:10:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:10,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:10:10,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:10:10,633 INFO L87 Difference]: Start difference. First operand 258 states and 277 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:10,856 INFO L93 Difference]: Finished difference Result 263 states and 278 transitions. [2024-11-10 19:10:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:10:10,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88 [2024-11-10 19:10:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:10,858 INFO L225 Difference]: With dead ends: 263 [2024-11-10 19:10:10,858 INFO L226 Difference]: Without dead ends: 262 [2024-11-10 19:10:10,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:10,859 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 179 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:10,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 226 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 19:10:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-10 19:10:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2024-11-10 19:10:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 214 states have (on average 1.2242990654205608) internal successors, (262), 246 states have internal predecessors, (262), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 19:10:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 276 transitions. [2024-11-10 19:10:10,872 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 276 transitions. Word has length 88 [2024-11-10 19:10:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:10,873 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 276 transitions. [2024-11-10 19:10:10,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 19:10:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 276 transitions. [2024-11-10 19:10:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 19:10:10,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:10,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:10,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 19:10:10,874 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:10,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1787205195, now seen corresponding path program 1 times [2024-11-10 19:10:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205191212] [2024-11-10 19:10:10,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:10,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:10,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:10,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205191212] [2024-11-10 19:10:10,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205191212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:10,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:10,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:10:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944866682] [2024-11-10 19:10:10,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:10,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:10:10,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:10,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:10:10,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:10,985 INFO L87 Difference]: Start difference. First operand 258 states and 276 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 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) [2024-11-10 19:10:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:11,103 INFO L93 Difference]: Finished difference Result 299 states and 318 transitions. [2024-11-10 19:10:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 19:10:11,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 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 89 [2024-11-10 19:10:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:11,105 INFO L225 Difference]: With dead ends: 299 [2024-11-10 19:10:11,105 INFO L226 Difference]: Without dead ends: 298 [2024-11-10 19:10:11,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:10:11,106 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 55 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:11,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 664 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-10 19:10:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 285. [2024-11-10 19:10:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 239 states have (on average 1.205020920502092) internal successors, (288), 271 states have internal predecessors, (288), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:10:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 304 transitions. [2024-11-10 19:10:11,122 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 304 transitions. Word has length 89 [2024-11-10 19:10:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:11,122 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 304 transitions. [2024-11-10 19:10:11,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 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) [2024-11-10 19:10:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 304 transitions. [2024-11-10 19:10:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 19:10:11,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:11,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:11,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 19:10:11,124 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:11,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1285461987, now seen corresponding path program 1 times [2024-11-10 19:10:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140218873] [2024-11-10 19:10:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:11,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:11,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140218873] [2024-11-10 19:10:11,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140218873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:11,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550976095] [2024-11-10 19:10:11,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:11,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:11,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:11,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 19:10:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:11,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 19:10:11,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:11,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550976095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:11,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2024-11-10 19:10:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770695963] [2024-11-10 19:10:11,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:11,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 19:10:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:11,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 19:10:11,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-10 19:10:11,615 INFO L87 Difference]: Start difference. First operand 285 states and 304 transitions. Second operand has 18 states, 17 states have (on average 9.588235294117647) internal successors, (163), 18 states have internal predecessors, (163), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 19:10:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:11,899 INFO L93 Difference]: Finished difference Result 436 states and 466 transitions. [2024-11-10 19:10:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 19:10:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 9.588235294117647) internal successors, (163), 18 states have internal predecessors, (163), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 94 [2024-11-10 19:10:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:11,901 INFO L225 Difference]: With dead ends: 436 [2024-11-10 19:10:11,901 INFO L226 Difference]: Without dead ends: 433 [2024-11-10 19:10:11,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2024-11-10 19:10:11,902 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 150 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:11,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1174 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-10 19:10:11,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 400. [2024-11-10 19:10:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 349 states have (on average 1.180515759312321) internal successors, (412), 381 states have internal predecessors, (412), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 19:10:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 434 transitions. [2024-11-10 19:10:11,925 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 434 transitions. Word has length 94 [2024-11-10 19:10:11,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:11,925 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 434 transitions. [2024-11-10 19:10:11,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 9.588235294117647) internal successors, (163), 18 states have internal predecessors, (163), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-10 19:10:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 434 transitions. [2024-11-10 19:10:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 19:10:11,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:11,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:11,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 19:10:12,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:12,137 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:12,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1823456583, now seen corresponding path program 1 times [2024-11-10 19:10:12,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:12,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161498935] [2024-11-10 19:10:12,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161498935] [2024-11-10 19:10:12,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161498935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078835631] [2024-11-10 19:10:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:12,251 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:12,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 19:10:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:12,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:10:12,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 19:10:12,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:12,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078835631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:12,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:10:12,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2024-11-10 19:10:12,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535489690] [2024-11-10 19:10:12,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:12,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 19:10:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 19:10:12,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 19:10:12,537 INFO L87 Difference]: Start difference. First operand 400 states and 434 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 19:10:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:12,650 INFO L93 Difference]: Finished difference Result 544 states and 587 transitions. [2024-11-10 19:10:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 19:10:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 98 [2024-11-10 19:10:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:12,653 INFO L225 Difference]: With dead ends: 544 [2024-11-10 19:10:12,653 INFO L226 Difference]: Without dead ends: 372 [2024-11-10 19:10:12,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 198 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-10 19:10:12,654 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 21 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:12,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 787 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-10 19:10:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2024-11-10 19:10:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 322 states have (on average 1.1583850931677018) internal successors, (373), 354 states have internal predecessors, (373), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 19:10:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 393 transitions. [2024-11-10 19:10:12,673 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 393 transitions. Word has length 98 [2024-11-10 19:10:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:12,673 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 393 transitions. [2024-11-10 19:10:12,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 19:10:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 393 transitions. [2024-11-10 19:10:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 19:10:12,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:12,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:12,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 19:10:12,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:12,875 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:12,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1186135731, now seen corresponding path program 1 times [2024-11-10 19:10:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:12,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470943911] [2024-11-10 19:10:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470943911] [2024-11-10 19:10:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470943911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:10:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518907673] [2024-11-10 19:10:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:13,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:13,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:13,019 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:13,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 19:10:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:10:13,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 19:10:13,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:10:13,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518907673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:13,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:10:13,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2024-11-10 19:10:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785500701] [2024-11-10 19:10:13,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:13,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:10:13,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:10:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 19:10:13,138 INFO L87 Difference]: Start difference. First operand 372 states and 393 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:13,237 INFO L93 Difference]: Finished difference Result 616 states and 655 transitions. [2024-11-10 19:10:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:10:13,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-10 19:10:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:13,240 INFO L225 Difference]: With dead ends: 616 [2024-11-10 19:10:13,240 INFO L226 Difference]: Without dead ends: 406 [2024-11-10 19:10:13,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-10 19:10:13,241 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 55 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:13,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 643 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:10:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-10 19:10:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 373. [2024-11-10 19:10:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 326 states have (on average 1.1411042944785277) internal successors, (372), 355 states have internal predecessors, (372), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 19:10:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 392 transitions. [2024-11-10 19:10:13,268 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 392 transitions. Word has length 108 [2024-11-10 19:10:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:13,268 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 392 transitions. [2024-11-10 19:10:13,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 19:10:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 392 transitions. [2024-11-10 19:10:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 19:10:13,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:13,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:13,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 19:10:13,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 19:10:13,474 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:13,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash 164072011, now seen corresponding path program 1 times [2024-11-10 19:10:13,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:13,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113013758] [2024-11-10 19:10:13,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:13,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 19:10:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587212061] [2024-11-10 19:10:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:13,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:10:13,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:10:13,502 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:10:13,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 19:10:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:13,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 19:10:13,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:10:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:13,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:10:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 19:10:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113013758] [2024-11-10 19:10:13,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 19:10:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587212061] [2024-11-10 19:10:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587212061] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:10:13,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 19:10:13,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-11-10 19:10:13,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048642683] [2024-11-10 19:10:13,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 19:10:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:10:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:13,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:10:13,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 19:10:13,821 INFO L87 Difference]: Start difference. First operand 373 states and 392 transitions. Second operand has 6 states, 5 states have (on average 36.0) internal successors, (180), 6 states have internal predecessors, (180), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 19:10:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:14,132 INFO L93 Difference]: Finished difference Result 624 states and 702 transitions. [2024-11-10 19:10:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:10:14,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 36.0) internal successors, (180), 6 states have internal predecessors, (180), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 113 [2024-11-10 19:10:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:14,135 INFO L225 Difference]: With dead ends: 624 [2024-11-10 19:10:14,135 INFO L226 Difference]: Without dead ends: 568 [2024-11-10 19:10:14,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:10:14,136 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 262 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:14,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 368 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:10:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-10 19:10:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 509. [2024-11-10 19:10:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 473 states have (on average 1.1522198731501057) internal successors, (545), 487 states have internal predecessors, (545), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 19:10:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 573 transitions. [2024-11-10 19:10:14,175 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 573 transitions. Word has length 113 [2024-11-10 19:10:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:14,176 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 573 transitions. [2024-11-10 19:10:14,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.0) internal successors, (180), 6 states have internal predecessors, (180), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-10 19:10:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 573 transitions. [2024-11-10 19:10:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 19:10:14,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:14,177 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-11-10 19:10:14,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 19:10:14,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 19:10:14,378 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:14,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1247763218, now seen corresponding path program 1 times [2024-11-10 19:10:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:14,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647117043] [2024-11-10 19:10:14,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 19:10:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 19:10:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,435 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-10 19:10:14,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:14,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647117043] [2024-11-10 19:10:14,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647117043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:14,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:14,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 19:10:14,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720546434] [2024-11-10 19:10:14,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:14,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:10:14,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:10:14,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:14,437 INFO L87 Difference]: Start difference. First operand 509 states and 573 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:10:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:14,471 INFO L93 Difference]: Finished difference Result 528 states and 588 transitions. [2024-11-10 19:10:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:10:14,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 158 [2024-11-10 19:10:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:14,473 INFO L225 Difference]: With dead ends: 528 [2024-11-10 19:10:14,473 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 19:10:14,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:10:14,474 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:14,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 201 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 19:10:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-10 19:10:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 209 states have (on average 1.0239234449760766) internal successors, (214), 211 states have internal predecessors, (214), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 19:10:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 230 transitions. [2024-11-10 19:10:14,489 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 230 transitions. Word has length 158 [2024-11-10 19:10:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:14,489 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 230 transitions. [2024-11-10 19:10:14,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 19:10:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 230 transitions. [2024-11-10 19:10:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 19:10:14,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:10:14,491 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-10 19:10:14,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 19:10:14,492 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2024-11-10 19:10:14,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:10:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1847076474, now seen corresponding path program 1 times [2024-11-10 19:10:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:10:14,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052615888] [2024-11-10 19:10:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:10:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:10:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 19:10:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 19:10:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 19:10:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 19:10:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-10 19:10:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 19:10:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 19:10:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:10:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-10 19:10:14,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:10:14,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052615888] [2024-11-10 19:10:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052615888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:10:14,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:10:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 19:10:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650891278] [2024-11-10 19:10:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:10:14,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 19:10:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:10:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 19:10:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 19:10:14,619 INFO L87 Difference]: Start difference. First operand 227 states and 230 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 19:10:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:10:14,668 INFO L93 Difference]: Finished difference Result 227 states and 230 transitions. [2024-11-10 19:10:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 19:10:14,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 186 [2024-11-10 19:10:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:10:14,669 INFO L225 Difference]: With dead ends: 227 [2024-11-10 19:10:14,669 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:10:14,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 19:10:14,670 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:10:14,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 391 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:10:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:10:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:10:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:10:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:10:14,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2024-11-10 19:10:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:10:14,672 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:10:14,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 19:10:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:10:14,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:10:14,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 98 remaining) [2024-11-10 19:10:14,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 98 remaining) [2024-11-10 19:10:14,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 98 remaining) [2024-11-10 19:10:14,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 98 remaining) [2024-11-10 19:10:14,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 98 remaining) [2024-11-10 19:10:14,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 98 remaining) [2024-11-10 19:10:14,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 98 remaining) [2024-11-10 19:10:14,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 98 remaining) [2024-11-10 19:10:14,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 98 remaining) [2024-11-10 19:10:14,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 98 remaining) [2024-11-10 19:10:14,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 98 remaining) [2024-11-10 19:10:14,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 98 remaining) [2024-11-10 19:10:14,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 98 remaining) [2024-11-10 19:10:14,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 98 remaining) [2024-11-10 19:10:14,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 98 remaining) [2024-11-10 19:10:14,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 98 remaining) [2024-11-10 19:10:14,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 98 remaining) [2024-11-10 19:10:14,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 98 remaining) [2024-11-10 19:10:14,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 98 remaining) [2024-11-10 19:10:14,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 98 remaining) [2024-11-10 19:10:14,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 98 remaining) [2024-11-10 19:10:14,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 98 remaining) [2024-11-10 19:10:14,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 98 remaining) [2024-11-10 19:10:14,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 98 remaining) [2024-11-10 19:10:14,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 98 remaining) [2024-11-10 19:10:14,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 98 remaining) [2024-11-10 19:10:14,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 98 remaining) [2024-11-10 19:10:14,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 98 remaining) [2024-11-10 19:10:14,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 98 remaining) [2024-11-10 19:10:14,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 98 remaining) [2024-11-10 19:10:14,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 98 remaining) [2024-11-10 19:10:14,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 98 remaining) [2024-11-10 19:10:14,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 98 remaining) [2024-11-10 19:10:14,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 98 remaining) [2024-11-10 19:10:14,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 98 remaining) [2024-11-10 19:10:14,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 98 remaining) [2024-11-10 19:10:14,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 98 remaining) [2024-11-10 19:10:14,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 98 remaining) [2024-11-10 19:10:14,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 98 remaining) [2024-11-10 19:10:14,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 98 remaining) [2024-11-10 19:10:14,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 98 remaining) [2024-11-10 19:10:14,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 98 remaining) [2024-11-10 19:10:14,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 98 remaining) [2024-11-10 19:10:14,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 98 remaining) [2024-11-10 19:10:14,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 98 remaining) [2024-11-10 19:10:14,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 98 remaining) [2024-11-10 19:10:14,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 98 remaining) [2024-11-10 19:10:14,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 98 remaining) [2024-11-10 19:10:14,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 98 remaining) [2024-11-10 19:10:14,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 98 remaining) [2024-11-10 19:10:14,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 98 remaining) [2024-11-10 19:10:14,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 98 remaining) [2024-11-10 19:10:14,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 98 remaining) [2024-11-10 19:10:14,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 98 remaining) [2024-11-10 19:10:14,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 98 remaining) [2024-11-10 19:10:14,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 98 remaining) [2024-11-10 19:10:14,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 98 remaining) [2024-11-10 19:10:14,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 98 remaining) [2024-11-10 19:10:14,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 98 remaining) [2024-11-10 19:10:14,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 98 remaining) [2024-11-10 19:10:14,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 98 remaining) [2024-11-10 19:10:14,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 98 remaining) [2024-11-10 19:10:14,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 19:10:14,690 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:10:14,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:10:23,211 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification. DAG size of input: 65 DAG size of output: 49 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-10 19:10:31,572 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification. DAG size of input: 68 DAG size of output: 52 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-10 19:10:32,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:10:32,172 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,178 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,179 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,183 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,187 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,190 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,193 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:10:32,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:10:32 BoogieIcfgContainer [2024-11-10 19:10:32,205 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:10:32,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:10:32,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:10:32,205 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:10:32,206 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:10:00" (3/4) ... [2024-11-10 19:10:32,208 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:10:32,212 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 19:10:32,212 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-10 19:10:32,223 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-10 19:10:32,224 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 19:10:32,224 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 19:10:32,225 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:10:32,346 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:10:32,347 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:10:32,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:10:32,347 INFO L158 Benchmark]: Toolchain (without parser) took 33327.41ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 99.7MB in the beginning and 118.1MB in the end (delta: -18.4MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-10 19:10:32,348 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 176.2MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:10:32,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.32ms. Allocated memory is still 176.2MB. Free memory was 99.4MB in the beginning and 86.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:10:32,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.54ms. Allocated memory is still 176.2MB. Free memory was 86.5MB in the beginning and 84.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:10:32,349 INFO L158 Benchmark]: Boogie Preprocessor took 44.73ms. Allocated memory is still 176.2MB. Free memory was 84.2MB in the beginning and 82.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:10:32,349 INFO L158 Benchmark]: IcfgBuilder took 777.60ms. Allocated memory is still 176.2MB. Free memory was 82.4MB in the beginning and 120.1MB in the end (delta: -37.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-10 19:10:32,349 INFO L158 Benchmark]: TraceAbstraction took 32041.59ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 120.1MB in the beginning and 125.5MB in the end (delta: -5.4MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2024-11-10 19:10:32,349 INFO L158 Benchmark]: Witness Printer took 141.85ms. Allocated memory is still 228.6MB. Free memory was 125.5MB in the beginning and 118.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 19:10:32,351 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.83ms. Allocated memory is still 176.2MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.32ms. Allocated memory is still 176.2MB. Free memory was 99.4MB in the beginning and 86.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.54ms. Allocated memory is still 176.2MB. Free memory was 86.5MB in the beginning and 84.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.73ms. Allocated memory is still 176.2MB. Free memory was 84.2MB in the beginning and 82.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 777.60ms. Allocated memory is still 176.2MB. Free memory was 82.4MB in the beginning and 120.1MB in the end (delta: -37.7MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32041.59ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 120.1MB in the beginning and 125.5MB in the end (delta: -5.4MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. * Witness Printer took 141.85ms. Allocated memory is still 228.6MB. Free memory was 125.5MB in the beginning and 118.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 236 locations, 98 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 25, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3540 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3500 mSDsluCounter, 13721 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9582 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3159 IncrementalHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 4139 mSDtfsCounter, 3159 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1229 GetRequests, 1069 SyntacticMatches, 5 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=14, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 642 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2206 NumberOfCodeBlocks, 2206 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2251 ConstructedInterpolants, 17 QuantifiedInterpolants, 7923 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 34 InterpolantComputations, 20 PerfectInterpolantSequences, 418/480 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 98 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: (((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (r <= 0)) && (A <= 2147483647)) && (counter == 2)) || ((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (3 == v)) && (counter <= 2147483645)) && (A <= 2147483647)) && (0 <= A)) && (3 <= counter))) || (((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter <= 2147483645)) && (A <= 2147483647)) && (3 <= counter))) - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (4 <= counter)) && (counter <= 2147483646)) || ((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (3 == v)) && (A <= 2147483647)) && (4 <= counter)) && (counter <= 2147483646)) && (0 <= A))) || (((((((counter == 3) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (r <= 0)) && (A <= 2147483647))) || ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter == 0)) && (A <= 2147483647))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (((cond != 0) && (counter == 0)) && (counter == \old(counter))) - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-10 19:10:32,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE