./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:40:22,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:40:22,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:40:22,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:40:22,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:40:22,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:40:22,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:40:22,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:40:22,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:40:22,392 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:40:22,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:40:22,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:40:22,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:40:22,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:40:22,393 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:40:22,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:40:22,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:40:22,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:40:22,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:40:22,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:40:22,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:40:22,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:40:22,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:40:22,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:40:22,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:40:22,400 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:40:22,400 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:40:22,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:40:22,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:40:22,401 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:40:22,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:40:22,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:40:22,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:40:22,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:40:22,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:40:22,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:40:22,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:40:22,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:40:22,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:40:22,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:40:22,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:40:22,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:40:22,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:40:22,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:40:22,404 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-clean/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-clean/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 -> 7e073a4c36b82f2b6062e496bb836cd3d16667ec7228f4ab2b6689e74fa81265 [2024-10-11 20:40:22,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:40:22,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:40:22,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:40:22,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:40:22,661 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:40:22,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2024-10-11 20:40:24,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:40:24,231 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:40:24,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound20.i [2024-10-11 20:40:24,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2ea17dcf5/59f6f8d597344724ac8a4a21276f1fbf/FLAGf7e5cd09e [2024-10-11 20:40:24,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2ea17dcf5/59f6f8d597344724ac8a4a21276f1fbf [2024-10-11 20:40:24,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:40:24,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:40:24,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:40:24,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:40:24,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:40:24,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f91b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24, skipping insertion in model container [2024-10-11 20:40:24,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:40:24,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:40:24,878 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:40:24,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:40:24,915 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:40:24,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24 WrapperNode [2024-10-11 20:40:24,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:40:24,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:40:24,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:40:24,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:40:24,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,943 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-10-11 20:40:24,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:40:24,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:40:24,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:40:24,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:40:24,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,965 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-10-11 20:40:24,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:40:24,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:40:24,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:40:24,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:40:24,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (1/1) ... [2024-10-11 20:40:24,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:40:24,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:25,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:40:25,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:40:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:40:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:40:25,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:40:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:40:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:40:25,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:40:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 20:40:25,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 20:40:25,120 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:40:25,124 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:40:25,303 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 20:40:25,305 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:40:25,330 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:40:25,330 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:40:25,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:40:25 BoogieIcfgContainer [2024-10-11 20:40:25,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:40:25,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:40:25,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:40:25,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:40:25,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:40:24" (1/3) ... [2024-10-11 20:40:25,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2359fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:40:25, skipping insertion in model container [2024-10-11 20:40:25,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:40:24" (2/3) ... [2024-10-11 20:40:25,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2359fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:40:25, skipping insertion in model container [2024-10-11 20:40:25,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:40:25" (3/3) ... [2024-10-11 20:40:25,338 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2024-10-11 20:40:25,352 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:40:25,353 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 20:40:25,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:40:25,416 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;@5227c54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:40:25,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 20:40:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:40:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:40:25,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:25,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:25,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:25,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1641202500, now seen corresponding path program 1 times [2024-10-11 20:40:25,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:25,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073529562] [2024-10-11 20:40:25,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:25,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:25,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:25,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073529562] [2024-10-11 20:40:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073529562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:40:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:40:25,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804915670] [2024-10-11 20:40:25,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:25,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:40:25,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:25,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:40:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:40:25,626 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:25,656 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2024-10-11 20:40:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:40:25,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-10-11 20:40:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:25,665 INFO L225 Difference]: With dead ends: 63 [2024-10-11 20:40:25,666 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 20:40:25,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:40:25,670 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:25,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 20:40:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 20:40:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:40:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-11 20:40:25,698 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2024-10-11 20:40:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:25,699 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-11 20:40:25,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 20:40:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-11 20:40:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 20:40:25,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:25,700 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:40:25,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1895441916, now seen corresponding path program 1 times [2024-10-11 20:40:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206073465] [2024-10-11 20:40:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:25,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:25,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206073465] [2024-10-11 20:40:25,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206073465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:25,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:40:25,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:40:25,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738462059] [2024-10-11 20:40:25,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:25,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:40:25,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:25,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:40:25,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:40:25,803 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-11 20:40:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:25,842 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-10-11 20:40:25,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:40:25,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 14 [2024-10-11 20:40:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:25,843 INFO L225 Difference]: With dead ends: 47 [2024-10-11 20:40:25,843 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 20:40:25,844 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-10-11 20:40:25,845 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:25,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 20:40:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 20:40:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:40:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-11 20:40:25,850 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2024-10-11 20:40:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:25,851 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-11 20:40:25,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-10-11 20:40:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-11 20:40:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:40:25,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:25,853 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:25,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:40:25,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:25,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash 367584173, now seen corresponding path program 1 times [2024-10-11 20:40:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:25,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754704326] [2024-10-11 20:40:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754704326] [2024-10-11 20:40:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754704326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:26,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:40:26,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:40:26,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147506745] [2024-10-11 20:40:26,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:26,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:40:26,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:40:26,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:40:26,101 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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-10-11 20:40:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:26,210 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-10-11 20:40:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 20:40:26,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 19 [2024-10-11 20:40:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:26,212 INFO L225 Difference]: With dead ends: 51 [2024-10-11 20:40:26,212 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 20:40:26,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:40:26,214 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:26,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 109 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 20:40:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2024-10-11 20:40:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:40:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-11 20:40:26,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 19 [2024-10-11 20:40:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:26,226 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-11 20:40:26,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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-10-11 20:40:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-10-11 20:40:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 20:40:26,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:26,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:26,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:40:26,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:26,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash 367585423, now seen corresponding path program 1 times [2024-10-11 20:40:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79049111] [2024-10-11 20:40:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:26,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79049111] [2024-10-11 20:40:26,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79049111] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500366253] [2024-10-11 20:40:26,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:26,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:26,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:26,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:26,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:40:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:40:26,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:26,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:40:26,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500366253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:26,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:40:26,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:40:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393365915] [2024-10-11 20:40:26,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:26,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:40:26,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:26,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:40:26,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:40:26,576 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-10-11 20:40:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:26,604 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-10-11 20:40:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:40:26,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 19 [2024-10-11 20:40:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:26,605 INFO L225 Difference]: With dead ends: 52 [2024-10-11 20:40:26,605 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 20:40:26,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:40:26,606 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:26,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 20:40:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2024-10-11 20:40:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:40:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-11 20:40:26,611 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 19 [2024-10-11 20:40:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:26,611 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-11 20:40:26,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-10-11 20:40:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-11 20:40:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:40:26,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:26,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:26,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:40:26,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:26,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:26,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:26,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1489792460, now seen corresponding path program 1 times [2024-10-11 20:40:26,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:26,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757868427] [2024-10-11 20:40:26,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:26,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:26,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:26,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757868427] [2024-10-11 20:40:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757868427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:26,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:40:26,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:40:26,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740367655] [2024-10-11 20:40:26,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:26,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:40:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:26,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:40:26,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:40:26,901 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-10-11 20:40:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:26,939 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-10-11 20:40:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:40:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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 20 [2024-10-11 20:40:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:26,940 INFO L225 Difference]: With dead ends: 52 [2024-10-11 20:40:26,940 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 20:40:26,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:40:26,941 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:26,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 20:40:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2024-10-11 20:40:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.25) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:40:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-10-11 20:40:26,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 20 [2024-10-11 20:40:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:26,946 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-10-11 20:40:26,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-10-11 20:40:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-10-11 20:40:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 20:40:26,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:26,947 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:26,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:40:26,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:26,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1489753731, now seen corresponding path program 1 times [2024-10-11 20:40:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388852121] [2024-10-11 20:40:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:26,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388852121] [2024-10-11 20:40:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388852121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887263451] [2024-10-11 20:40:27,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:27,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:27,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:27,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:27,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:40:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:27,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:40:27,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:27,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:40:27,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887263451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:27,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:40:27,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 20:40:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771428451] [2024-10-11 20:40:27,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:27,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:40:27,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:27,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:40:27,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 20:40:27,163 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-10-11 20:40:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:27,296 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-10-11 20:40:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:40:27,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 20 [2024-10-11 20:40:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:27,298 INFO L225 Difference]: With dead ends: 51 [2024-10-11 20:40:27,298 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 20:40:27,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:40:27,299 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:27,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 20:40:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-10-11 20:40:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:40:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-10-11 20:40:27,317 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 20 [2024-10-11 20:40:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:27,317 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-11 20:40:27,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-10-11 20:40:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-10-11 20:40:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 20:40:27,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:27,318 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:27,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:40:27,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:27,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:27,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1356283532, now seen corresponding path program 1 times [2024-10-11 20:40:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:27,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090844627] [2024-10-11 20:40:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:27,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:27,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:27,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090844627] [2024-10-11 20:40:27,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090844627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:27,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126981314] [2024-10-11 20:40:27,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:27,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:27,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:27,697 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:27,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:40:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:27,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:40:27,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:27,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:27,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126981314] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:27,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:27,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2024-10-11 20:40:27,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676246396] [2024-10-11 20:40:27,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:27,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 20:40:27,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 20:40:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 20:40:27,830 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:40:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:27,932 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2024-10-11 20:40:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 20:40:27,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 23 [2024-10-11 20:40:27,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:27,933 INFO L225 Difference]: With dead ends: 82 [2024-10-11 20:40:27,933 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 20:40:27,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:40:27,934 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:27,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 106 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 20:40:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-10-11 20:40:27,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.2) internal successors, (60), 51 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 20:40:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-10-11 20:40:27,939 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 23 [2024-10-11 20:40:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:27,939 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-10-11 20:40:27,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 20:40:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-10-11 20:40:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 20:40:27,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:27,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:27,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:28,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:28,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:28,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash 904934402, now seen corresponding path program 1 times [2024-10-11 20:40:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:28,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284095599] [2024-10-11 20:40:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:28,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:28,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284095599] [2024-10-11 20:40:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284095599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305750405] [2024-10-11 20:40:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:28,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:28,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:28,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:28,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:40:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:28,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:40:28,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:28,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:40:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305750405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:40:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:40:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-10-11 20:40:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728203041] [2024-10-11 20:40:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:40:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:40:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:40:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:40:28,456 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-10-11 20:40:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:28,524 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-10-11 20:40:28,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:40:28,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 24 [2024-10-11 20:40:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:28,526 INFO L225 Difference]: With dead ends: 59 [2024-10-11 20:40:28,526 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 20:40:28,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-11 20:40:28,527 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:28,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:40:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 20:40:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2024-10-11 20:40:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 20:40:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-10-11 20:40:28,538 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 24 [2024-10-11 20:40:28,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:28,538 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-10-11 20:40:28,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-10-11 20:40:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-10-11 20:40:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 20:40:28,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:28,539 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:28,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:40:28,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 20:40:28,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:28,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2011804545, now seen corresponding path program 1 times [2024-10-11 20:40:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:28,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562214900] [2024-10-11 20:40:28,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:28,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:28,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562214900] [2024-10-11 20:40:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562214900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761095996] [2024-10-11 20:40:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:28,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:28,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:28,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:28,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 20:40:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:28,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 20:40:28,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:28,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761095996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:29,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2024-10-11 20:40:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760473885] [2024-10-11 20:40:29,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:29,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 20:40:29,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:29,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 20:40:29,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:40:29,055 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 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-10-11 20:40:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:29,336 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-10-11 20:40:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 20:40:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 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 25 [2024-10-11 20:40:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:29,338 INFO L225 Difference]: With dead ends: 76 [2024-10-11 20:40:29,338 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 20:40:29,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-10-11 20:40:29,339 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:29,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 162 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:29,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 20:40:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-10-11 20:40:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.152542372881356) internal successors, (68), 59 states have internal predecessors, (68), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 20:40:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-10-11 20:40:29,354 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 25 [2024-10-11 20:40:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:29,354 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-10-11 20:40:29,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 19 states have internal predecessors, (44), 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-10-11 20:40:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-10-11 20:40:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 20:40:29,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:29,355 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:29,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:29,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:29,557 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1808115458, now seen corresponding path program 1 times [2024-10-11 20:40:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:29,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718884513] [2024-10-11 20:40:29,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:29,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:40:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:40:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 20:40:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:29,816 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:40:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718884513] [2024-10-11 20:40:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718884513] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668419712] [2024-10-11 20:40:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:29,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:29,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:29,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:29,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 20:40:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:29,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 20:40:29,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:30,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 20:40:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668419712] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:30,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2024-10-11 20:40:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082810907] [2024-10-11 20:40:30,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 20:40:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:30,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 20:40:30,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2024-10-11 20:40:30,215 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 31 states have internal predecessors, (95), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 20:40:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:30,685 INFO L93 Difference]: Finished difference Result 222 states and 252 transitions. [2024-10-11 20:40:30,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 20:40:30,686 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 31 states have internal predecessors, (95), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) Word has length 53 [2024-10-11 20:40:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:30,687 INFO L225 Difference]: With dead ends: 222 [2024-10-11 20:40:30,688 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 20:40:30,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 20:40:30,690 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 196 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:30,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 242 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 20:40:30,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2024-10-11 20:40:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 140 states have (on average 1.1285714285714286) internal successors, (158), 140 states have internal predecessors, (158), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 20:40:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2024-10-11 20:40:30,714 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 53 [2024-10-11 20:40:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:30,714 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2024-10-11 20:40:30,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.1666666666666665) internal successors, (95), 31 states have internal predecessors, (95), 11 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-11 20:40:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2024-10-11 20:40:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 20:40:30,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:30,718 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:30,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:30,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 20:40:30,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:30,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1200701576, now seen corresponding path program 1 times [2024-10-11 20:40:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:30,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135192894] [2024-10-11 20:40:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:31,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:31,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:31,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 20:40:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:31,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 20:40:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 20:40:31,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135192894] [2024-10-11 20:40:31,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135192894] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284444757] [2024-10-11 20:40:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:31,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:31,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:31,144 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:31,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 20:40:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:31,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 20:40:31,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 20:40:31,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 20:40:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284444757] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:31,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:31,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 25 [2024-10-11 20:40:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581891063] [2024-10-11 20:40:31,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:31,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 20:40:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 20:40:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:40:31,377 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 20:40:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:31,620 INFO L93 Difference]: Finished difference Result 248 states and 280 transitions. [2024-10-11 20:40:31,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 20:40:31,620 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2024-10-11 20:40:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:31,622 INFO L225 Difference]: With dead ends: 248 [2024-10-11 20:40:31,622 INFO L226 Difference]: Without dead ends: 222 [2024-10-11 20:40:31,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=576, Invalid=1230, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 20:40:31,623 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 181 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:31,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 156 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-11 20:40:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2024-10-11 20:40:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 170 states have (on average 1.1411764705882352) internal successors, (194), 170 states have internal predecessors, (194), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 20:40:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2024-10-11 20:40:31,643 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 61 [2024-10-11 20:40:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:31,644 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2024-10-11 20:40:31,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 20:40:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2024-10-11 20:40:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 20:40:31,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:31,649 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:31,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 20:40:31,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:31,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:31,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:31,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1728550616, now seen corresponding path program 2 times [2024-10-11 20:40:31,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:31,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708255099] [2024-10-11 20:40:31,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:31,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:32,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:32,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:32,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:40:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:32,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:40:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 20:40:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:32,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708255099] [2024-10-11 20:40:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708255099] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:32,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259534797] [2024-10-11 20:40:32,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:40:32,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:32,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:32,253 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:32,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 20:40:32,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:40:32,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:40:32,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 20:40:32,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 20:40:32,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 20:40:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259534797] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:32,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 45 [2024-10-11 20:40:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177815205] [2024-10-11 20:40:32,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-11 20:40:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:32,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-11 20:40:32,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1433, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 20:40:32,821 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 20:40:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:33,560 INFO L93 Difference]: Finished difference Result 328 states and 374 transitions. [2024-10-11 20:40:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-11 20:40:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2024-10-11 20:40:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:33,562 INFO L225 Difference]: With dead ends: 328 [2024-10-11 20:40:33,562 INFO L226 Difference]: Without dead ends: 302 [2024-10-11 20:40:33,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 165 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1705 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2146, Invalid=4660, Unknown=0, NotChecked=0, Total=6806 [2024-10-11 20:40:33,565 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 229 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:33,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 241 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 20:40:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-11 20:40:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 248. [2024-10-11 20:40:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 220 states have (on average 1.1545454545454545) internal successors, (254), 220 states have internal predecessors, (254), 14 states have call successors, (14), 13 states have call predecessors, (14), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 20:40:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 282 transitions. [2024-10-11 20:40:33,577 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 282 transitions. Word has length 91 [2024-10-11 20:40:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:33,577 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 282 transitions. [2024-10-11 20:40:33,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 20:40:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2024-10-11 20:40:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 20:40:33,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:33,579 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:33,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 20:40:33,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 20:40:33,780 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:33,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:33,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1708158849, now seen corresponding path program 1 times [2024-10-11 20:40:33,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:33,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850808834] [2024-10-11 20:40:33,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:33,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 20:40:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:40:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 20:40:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:40:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:40:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 20:40:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:40:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 20:40:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-11 20:40:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850808834] [2024-10-11 20:40:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850808834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698140645] [2024-10-11 20:40:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:34,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:34,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:34,229 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:34,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 20:40:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:34,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 20:40:34,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:34,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-11 20:40:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698140645] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:35,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:35,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 66 [2024-10-11 20:40:35,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116820330] [2024-10-11 20:40:35,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:35,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-11 20:40:35,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:35,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-11 20:40:35,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1012, Invalid=3410, Unknown=0, NotChecked=0, Total=4422 [2024-10-11 20:40:35,434 INFO L87 Difference]: Start difference. First operand 248 states and 282 transitions. Second operand has 67 states, 66 states have (on average 3.257575757575758) internal successors, (215), 67 states have internal predecessors, (215), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-10-11 20:40:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:36,919 INFO L93 Difference]: Finished difference Result 632 states and 718 transitions. [2024-10-11 20:40:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-10-11 20:40:36,919 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 3.257575757575758) internal successors, (215), 67 states have internal predecessors, (215), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 113 [2024-10-11 20:40:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:36,922 INFO L225 Difference]: With dead ends: 632 [2024-10-11 20:40:36,922 INFO L226 Difference]: Without dead ends: 631 [2024-10-11 20:40:36,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3742 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4499, Invalid=11757, Unknown=0, NotChecked=0, Total=16256 [2024-10-11 20:40:36,926 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 490 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:36,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 392 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:40:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-11 20:40:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 413. [2024-10-11 20:40:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 355 states have (on average 1.1380281690140845) internal successors, (404), 355 states have internal predecessors, (404), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 20:40:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 462 transitions. [2024-10-11 20:40:36,943 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 462 transitions. Word has length 113 [2024-10-11 20:40:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:36,944 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 462 transitions. [2024-10-11 20:40:36,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 3.257575757575758) internal successors, (215), 67 states have internal predecessors, (215), 26 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2024-10-11 20:40:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 462 transitions. [2024-10-11 20:40:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 20:40:36,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:36,946 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:36,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:37,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:37,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:37,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1128118700, now seen corresponding path program 2 times [2024-10-11 20:40:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405608587] [2024-10-11 20:40:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 20:40:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:40:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 20:40:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:40:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 20:40:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 20:40:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:40:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:40:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 20:40:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 20:40:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:40:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:40:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 20:40:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 20:40:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 20:40:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 20:40:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-11 20:40:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 20:40:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 1115 proven. 25 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-11 20:40:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:38,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405608587] [2024-10-11 20:40:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405608587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:38,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156851570] [2024-10-11 20:40:38,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:40:38,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:38,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:38,518 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:38,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 20:40:38,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:40:38,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:40:38,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 20:40:38,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 1735 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 20:40:38,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 1123 proven. 17 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-11 20:40:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156851570] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:39,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43, 44] total 47 [2024-10-11 20:40:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931439621] [2024-10-11 20:40:39,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:39,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-11 20:40:39,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:39,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-11 20:40:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1699, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 20:40:39,656 INFO L87 Difference]: Start difference. First operand 413 states and 462 transitions. Second operand has 47 states, 47 states have (on average 4.191489361702128) internal successors, (197), 47 states have internal predecessors, (197), 20 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (42), 20 states have call predecessors, (42), 20 states have call successors, (42) [2024-10-11 20:40:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:40,588 INFO L93 Difference]: Finished difference Result 619 states and 686 transitions. [2024-10-11 20:40:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-11 20:40:40,589 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.191489361702128) internal successors, (197), 47 states have internal predecessors, (197), 20 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (42), 20 states have call predecessors, (42), 20 states have call successors, (42) Word has length 228 [2024-10-11 20:40:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:40,590 INFO L225 Difference]: With dead ends: 619 [2024-10-11 20:40:40,591 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 20:40:40,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 452 SyntacticMatches, 41 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2799 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1940, Invalid=5542, Unknown=0, NotChecked=0, Total=7482 [2024-10-11 20:40:40,593 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 97 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:40,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1767 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:40:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 20:40:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2024-10-11 20:40:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 261 states have (on average 1.1111111111111112) internal successors, (290), 261 states have internal predecessors, (290), 29 states have call successors, (29), 28 states have call predecessors, (29), 28 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 20:40:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 348 transitions. [2024-10-11 20:40:40,607 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 348 transitions. Word has length 228 [2024-10-11 20:40:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:40,608 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 348 transitions. [2024-10-11 20:40:40,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.191489361702128) internal successors, (197), 47 states have internal predecessors, (197), 20 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (42), 20 states have call predecessors, (42), 20 states have call successors, (42) [2024-10-11 20:40:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 348 transitions. [2024-10-11 20:40:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-10-11 20:40:40,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:40:40,610 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:40,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 20:40:40,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:40:40,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 20:40:40,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:40:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash -492707838, now seen corresponding path program 2 times [2024-10-11 20:40:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:40:40,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115174889] [2024-10-11 20:40:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:40:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:40:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:40:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 20:40:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 20:40:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 20:40:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 20:40:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 20:40:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 20:40:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 20:40:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:40:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 20:40:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:40:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 20:40:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 20:40:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 20:40:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 20:40:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 20:40:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 20:40:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 20:40:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 20:40:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 20:40:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-11 20:40:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-11 20:40:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 20:40:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 20:40:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-11 20:40:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-11 20:40:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-11 20:40:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-10-11 20:40:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2024-10-11 20:40:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:40:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 356 proven. 7 refuted. 0 times theorem prover too weak. 3583 trivial. 0 not checked. [2024-10-11 20:40:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:40:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115174889] [2024-10-11 20:40:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115174889] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:40:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745945613] [2024-10-11 20:40:41,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 20:40:41,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:40:41,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:40:41,138 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:40:41,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 20:40:41,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 20:40:41,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 20:40:41,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 20:40:41,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:40:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 3622 proven. 19 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-11 20:40:42,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:40:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 2330 proven. 19 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2024-10-11 20:40:42,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745945613] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:40:42,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:40:42,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 43, 44] total 49 [2024-10-11 20:40:42,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938928825] [2024-10-11 20:40:42,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:40:42,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-11 20:40:42,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:40:42,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-11 20:40:42,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=1855, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 20:40:42,885 INFO L87 Difference]: Start difference. First operand 319 states and 348 transitions. Second operand has 49 states, 49 states have (on average 4.63265306122449) internal successors, (227), 49 states have internal predecessors, (227), 24 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) [2024-10-11 20:40:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:40:44,160 INFO L93 Difference]: Finished difference Result 319 states and 348 transitions. [2024-10-11 20:40:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-11 20:40:44,161 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.63265306122449) internal successors, (227), 49 states have internal predecessors, (227), 24 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) Word has length 317 [2024-10-11 20:40:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:40:44,161 INFO L225 Difference]: With dead ends: 319 [2024-10-11 20:40:44,162 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:40:44,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 627 SyntacticMatches, 41 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3903 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2960, Invalid=9250, Unknown=0, NotChecked=0, Total=12210 [2024-10-11 20:40:44,168 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 112 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:40:44,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1434 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:40:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:40:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:40:44,171 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-10-11 20:40:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:40:44,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 317 [2024-10-11 20:40:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:40:44,172 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:40:44,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.63265306122449) internal successors, (227), 49 states have internal predecessors, (227), 24 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 24 states have call predecessors, (49), 24 states have call successors, (49) [2024-10-11 20:40:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:40:44,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:40:44,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 20:40:44,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 20:40:44,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 20:40:44,176 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 20:40:44,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 20:40:44,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 20:40:44,379 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:40:44,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 20:40:45,445 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:40:45,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:40:45 BoogieIcfgContainer [2024-10-11 20:40:45,461 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:40:45,461 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:40:45,461 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:40:45,461 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:40:45,462 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:40:25" (3/4) ... [2024-10-11 20:40:45,463 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 20:40:45,467 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 20:40:45,467 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 20:40:45,471 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 20:40:45,472 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 20:40:45,472 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 20:40:45,472 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 20:40:45,551 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:40:45,551 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 20:40:45,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:40:45,552 INFO L158 Benchmark]: Toolchain (without parser) took 20922.86ms. Allocated memory was 146.8MB in the beginning and 408.9MB in the end (delta: 262.1MB). Free memory was 74.9MB in the beginning and 280.0MB in the end (delta: -205.0MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-10-11 20:40:45,552 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 146.8MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:40:45,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.52ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 74.8MB in the beginning and 166.4MB in the end (delta: -91.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-11 20:40:45,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.46ms. Allocated memory is still 195.0MB. Free memory was 166.4MB in the beginning and 164.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:40:45,552 INFO L158 Benchmark]: Boogie Preprocessor took 34.12ms. Allocated memory is still 195.0MB. Free memory was 164.3MB in the beginning and 163.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:40:45,553 INFO L158 Benchmark]: RCFGBuilder took 351.14ms. Allocated memory is still 195.0MB. Free memory was 163.3MB in the beginning and 149.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:40:45,553 INFO L158 Benchmark]: TraceAbstraction took 20128.09ms. Allocated memory was 195.0MB in the beginning and 408.9MB in the end (delta: 213.9MB). Free memory was 148.6MB in the beginning and 285.1MB in the end (delta: -136.5MB). Peak memory consumption was 229.7MB. Max. memory is 16.1GB. [2024-10-11 20:40:45,553 INFO L158 Benchmark]: Witness Printer took 90.19ms. Allocated memory is still 408.9MB. Free memory was 285.1MB in the beginning and 280.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 20:40:45,554 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.80ms. Allocated memory is still 146.8MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.52ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 74.8MB in the beginning and 166.4MB in the end (delta: -91.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.46ms. Allocated memory is still 195.0MB. Free memory was 166.4MB in the beginning and 164.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.12ms. Allocated memory is still 195.0MB. Free memory was 164.3MB in the beginning and 163.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 351.14ms. Allocated memory is still 195.0MB. Free memory was 163.3MB in the beginning and 149.6MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20128.09ms. Allocated memory was 195.0MB in the beginning and 408.9MB in the end (delta: 213.9MB). Free memory was 148.6MB in the beginning and 285.1MB in the end (delta: -136.5MB). Peak memory consumption was 229.7MB. Max. memory is 16.1GB. * Witness Printer took 90.19ms. Allocated memory is still 408.9MB. Free memory was 285.1MB in the beginning and 280.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 15, TraceHistogramMax: 28, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1555 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1555 mSDsluCounter, 5019 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4392 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3348 IncrementalHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 627 mSDtfsCounter, 3348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2507 GetRequests, 1827 SyntacticMatches, 86 SemanticMatches, 594 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13525 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=13, InterpolantAutomatonStates: 435, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 403 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2015 NumberOfCodeBlocks, 2015 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2892 ConstructedInterpolants, 0 QuantifiedInterpolants, 6290 SizeOfPredicates, 151 NumberOfNonLiveVariables, 2363 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 34 InterpolantComputations, 7 PerfectInterpolantSequences, 17487/19437 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 4 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((1 <= counter) && (counter <= 2)) || ((2 <= counter) && (counter <= 3))) || ((20 <= counter) && (counter <= 2147483646))) || ((counter <= 22) && (4 <= counter))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((counter <= 20) && (3 <= counter)) || (counter == 0)) || (counter == 1)) || (counter == 2)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: (counter == 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 20:40:45,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE