./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 7769e2cb1241ce193327f3081ef594a62cf8a609eb0db6e89ed527de779b57ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:21:04,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:21:04,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:21:04,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:21:04,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:21:04,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:21:04,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:21:04,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:21:04,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:21:04,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:21:04,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:21:04,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:21:04,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:21:04,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:21:04,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:21:04,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:21:04,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:21:04,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:21:04,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:21:04,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:21:04,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:21:04,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:21:04,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:21:04,985 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:21:04,985 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:21:04,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:21:04,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:21:04,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:21:04,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:21:04,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:21:04,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:21:04,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:21:04,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:21:04,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:21:04,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:21:04,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:21:04,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:21:04,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:21:04,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:21:04,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:21:04,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:21:04,989 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7769e2cb1241ce193327f3081ef594a62cf8a609eb0db6e89ed527de779b57ea [2024-10-11 23:21:05,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:21:05,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:21:05,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:21:05,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:21:05,274 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:21:05,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_good.i [2024-10-11 23:21:06,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:21:06,784 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:21:06,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_predec_17_good.i [2024-10-11 23:21:06,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d296f440c/b0e0877eb17e40a6aabb6aea39464f3e/FLAG9cb49818d [2024-10-11 23:21:06,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d296f440c/b0e0877eb17e40a6aabb6aea39464f3e [2024-10-11 23:21:06,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:21:06,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:21:06,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:21:06,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:21:06,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:21:06,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:21:06" (1/1) ... [2024-10-11 23:21:06,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf59c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:06, skipping insertion in model container [2024-10-11 23:21:06,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:21:06" (1/1) ... [2024-10-11 23:21:06,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:21:07,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:21:07,491 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:21:07,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:21:07,657 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:21:07,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07 WrapperNode [2024-10-11 23:21:07,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:21:07,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:21:07,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:21:07,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:21:07,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,721 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2024-10-11 23:21:07,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:21:07,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:21:07,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:21:07,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:21:07,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,749 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:21:07,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:21:07,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:21:07,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:21:07,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:21:07,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (1/1) ... [2024-10-11 23:21:07,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:21:07,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:21:07,789 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 23:21:07,791 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 23:21:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:21:07,834 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:21:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:21:07,835 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:21:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:21:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:21:07,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:21:07,962 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:21:07,964 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:21:08,171 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2024-10-11 23:21:08,172 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:21:08,191 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:21:08,191 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 23:21:08,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:21:08 BoogieIcfgContainer [2024-10-11 23:21:08,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:21:08,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:21:08,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:21:08,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:21:08,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:21:06" (1/3) ... [2024-10-11 23:21:08,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eeedcee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:21:08, skipping insertion in model container [2024-10-11 23:21:08,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:21:07" (2/3) ... [2024-10-11 23:21:08,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eeedcee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:21:08, skipping insertion in model container [2024-10-11 23:21:08,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:21:08" (3/3) ... [2024-10-11 23:21:08,202 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_predec_17_good.i [2024-10-11 23:21:08,216 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:21:08,216 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-11 23:21:08,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:21:08,274 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;@695deec0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:21:08,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 23:21:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 66 states have internal predecessors, (89), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 23:21:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 23:21:08,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:08,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:08,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:08,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1763285373, now seen corresponding path program 1 times [2024-10-11 23:21:08,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:08,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768258843] [2024-10-11 23:21:08,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:08,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:21:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:08,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768258843] [2024-10-11 23:21:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768258843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:21:08,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723724687] [2024-10-11 23:21:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:08,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:21:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:21:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:08,524 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 66 states have internal predecessors, (89), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:08,564 INFO L93 Difference]: Finished difference Result 141 states and 190 transitions. [2024-10-11 23:21:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:21:08,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 23:21:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:08,572 INFO L225 Difference]: With dead ends: 141 [2024-10-11 23:21:08,572 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 23:21:08,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:08,579 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 35 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:08,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 170 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 23:21:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2024-10-11 23:21:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 64 states have internal predecessors, (83), 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 23:21:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-10-11 23:21:08,614 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 12 [2024-10-11 23:21:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:08,615 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-10-11 23:21:08,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-10-11 23:21:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 23:21:08,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:08,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:21:08,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:08,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash 78825496, now seen corresponding path program 1 times [2024-10-11 23:21:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:08,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108970601] [2024-10-11 23:21:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:08,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:21:08,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108970601] [2024-10-11 23:21:08,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108970601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:08,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:08,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:21:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537784313] [2024-10-11 23:21:08,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:08,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:21:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:08,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:21:08,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:21:08,732 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:08,763 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2024-10-11 23:21:08,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:21:08,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-11 23:21:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:08,765 INFO L225 Difference]: With dead ends: 97 [2024-10-11 23:21:08,765 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 23:21:08,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:21:08,766 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:08,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 239 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 23:21:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 23:21:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 88 states have internal predecessors, (120), 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 23:21:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2024-10-11 23:21:08,773 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 15 [2024-10-11 23:21:08,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:08,774 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-10-11 23:21:08,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2024-10-11 23:21:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 23:21:08,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:08,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:08,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:21:08,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:08,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash -136497909, now seen corresponding path program 1 times [2024-10-11 23:21:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602678728] [2024-10-11 23:21:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:08,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:21:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:08,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602678728] [2024-10-11 23:21:08,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602678728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:08,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:08,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:21:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480411780] [2024-10-11 23:21:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:08,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:21:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:21:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:08,847 INFO L87 Difference]: Start difference. First operand 95 states and 128 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:08,875 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2024-10-11 23:21:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:21:08,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 23:21:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:08,878 INFO L225 Difference]: With dead ends: 95 [2024-10-11 23:21:08,878 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 23:21:08,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:08,879 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:08,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 158 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 23:21:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 23:21:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.5454545454545454) internal successors, (119), 87 states have internal predecessors, (119), 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 23:21:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2024-10-11 23:21:08,886 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 21 [2024-10-11 23:21:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:08,887 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2024-10-11 23:21:08,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2024-10-11 23:21:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 23:21:08,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:08,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:08,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:21:08,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:08,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash 63494512, now seen corresponding path program 1 times [2024-10-11 23:21:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18358844] [2024-10-11 23:21:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 23:21:08,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:08,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18358844] [2024-10-11 23:21:08,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18358844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:08,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:08,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:21:08,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389034672] [2024-10-11 23:21:08,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:08,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:21:08,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:08,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:21:08,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:08,961 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:08,993 INFO L93 Difference]: Finished difference Result 124 states and 162 transitions. [2024-10-11 23:21:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:21:08,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 23:21:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:08,995 INFO L225 Difference]: With dead ends: 124 [2024-10-11 23:21:08,995 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 23:21:08,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:08,996 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:08,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 159 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 23:21:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2024-10-11 23:21:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 88 states have internal predecessors, (120), 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 23:21:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2024-10-11 23:21:09,004 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 22 [2024-10-11 23:21:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:09,005 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2024-10-11 23:21:09,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2024-10-11 23:21:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 23:21:09,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:09,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:09,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:21:09,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 63532273, now seen corresponding path program 1 times [2024-10-11 23:21:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149984485] [2024-10-11 23:21:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:21:09,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:09,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149984485] [2024-10-11 23:21:09,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149984485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:09,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:09,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:21:09,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159902552] [2024-10-11 23:21:09,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:09,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:21:09,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:09,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:21:09,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:09,115 INFO L87 Difference]: Start difference. First operand 95 states and 128 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:09,139 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2024-10-11 23:21:09,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:21:09,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 23:21:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:09,140 INFO L225 Difference]: With dead ends: 95 [2024-10-11 23:21:09,141 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 23:21:09,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:09,142 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 46 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:09,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 104 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 23:21:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 23:21:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 87 states have internal predecessors, (119), 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 23:21:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2024-10-11 23:21:09,149 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 22 [2024-10-11 23:21:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:09,149 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2024-10-11 23:21:09,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2024-10-11 23:21:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 23:21:09,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:09,150 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 23:21:09,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:21:09,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:09,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1580869174, now seen corresponding path program 1 times [2024-10-11 23:21:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:09,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056505712] [2024-10-11 23:21:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:21:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056505712] [2024-10-11 23:21:09,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056505712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:21:09,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621086975] [2024-10-11 23:21:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:09,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:21:09,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:21:09,234 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 23:21:09,235 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 23:21:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 23:21:09,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:21:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:21:09,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:21:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621086975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:09,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:21:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 23:21:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790825517] [2024-10-11 23:21:09,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:09,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:21:09,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:09,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:21:09,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:21:09,364 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:09,387 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2024-10-11 23:21:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:21:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-11 23:21:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:09,388 INFO L225 Difference]: With dead ends: 134 [2024-10-11 23:21:09,388 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 23:21:09,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:21:09,389 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 29 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:09,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 227 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 23:21:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 23:21:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.462962962962963) internal successors, (79), 61 states have internal predecessors, (79), 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 23:21:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-10-11 23:21:09,393 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 24 [2024-10-11 23:21:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:09,394 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-10-11 23:21:09,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:21:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-10-11 23:21:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 23:21:09,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:09,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:09,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 23:21:09,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:21:09,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:09,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:09,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1102059512, now seen corresponding path program 1 times [2024-10-11 23:21:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:09,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017193135] [2024-10-11 23:21:09,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:21:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 23:21:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017193135] [2024-10-11 23:21:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017193135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:09,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:21:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356141354] [2024-10-11 23:21:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:09,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:21:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:09,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:21:09,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:21:09,666 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:21:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:09,695 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2024-10-11 23:21:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:21:09,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-11 23:21:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:09,697 INFO L225 Difference]: With dead ends: 80 [2024-10-11 23:21:09,698 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 23:21:09,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:21:09,699 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:09,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 227 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 23:21:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 23:21:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 69 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:21:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-10-11 23:21:09,707 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 28 [2024-10-11 23:21:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:09,708 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-10-11 23:21:09,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:21:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-10-11 23:21:09,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 23:21:09,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:09,709 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:09,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:21:09,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:09,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1014826324, now seen corresponding path program 1 times [2024-10-11 23:21:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:09,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905523725] [2024-10-11 23:21:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:09,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:21:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:21:09,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:09,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905523725] [2024-10-11 23:21:09,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905523725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:09,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:09,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:21:09,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325673260] [2024-10-11 23:21:09,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:09,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:21:09,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:09,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:21:09,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:21:09,795 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 23:21:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:09,824 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2024-10-11 23:21:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:21:09,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 33 [2024-10-11 23:21:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:09,826 INFO L225 Difference]: With dead ends: 97 [2024-10-11 23:21:09,826 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 23:21:09,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:21:09,827 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:09,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 23:21:09,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 23:21:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.4) internal successors, (91), 72 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:21:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2024-10-11 23:21:09,839 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 33 [2024-10-11 23:21:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:09,840 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2024-10-11 23:21:09,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 23:21:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2024-10-11 23:21:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 23:21:09,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:09,842 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:09,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:21:09,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:09,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:09,845 INFO L85 PathProgramCache]: Analyzing trace with hash 416408017, now seen corresponding path program 1 times [2024-10-11 23:21:09,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:09,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240281110] [2024-10-11 23:21:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:21:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:21:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240281110] [2024-10-11 23:21:09,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240281110] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:21:09,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175222813] [2024-10-11 23:21:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:09,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:21:09,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:21:09,922 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 23:21:09,924 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 23:21:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:09,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 23:21:09,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:21:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:21:10,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:21:10,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175222813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:10,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:21:10,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 23:21:10,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392159776] [2024-10-11 23:21:10,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:10,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:21:10,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:10,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:21:10,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:21:10,019 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:21:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:10,040 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2024-10-11 23:21:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:21:10,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-10-11 23:21:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:10,041 INFO L225 Difference]: With dead ends: 96 [2024-10-11 23:21:10,041 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 23:21:10,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:21:10,042 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:10,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 23:21:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 23:21:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 68 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:21:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2024-10-11 23:21:10,049 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 36 [2024-10-11 23:21:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:10,050 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2024-10-11 23:21:10,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 23:21:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-10-11 23:21:10,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 23:21:10,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:10,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:10,066 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 23:21:10,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:21:10,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash 734400244, now seen corresponding path program 1 times [2024-10-11 23:21:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849311844] [2024-10-11 23:21:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:21:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:21:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849311844] [2024-10-11 23:21:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849311844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:10,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:10,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:21:10,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814198669] [2024-10-11 23:21:10,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:10,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:21:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:10,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:21:10,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:10,295 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 23:21:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:10,310 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-10-11 23:21:10,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:21:10,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 38 [2024-10-11 23:21:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:10,311 INFO L225 Difference]: With dead ends: 81 [2024-10-11 23:21:10,311 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 23:21:10,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:10,312 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:10,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 23:21:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-10-11 23:21:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.353846153846154) internal successors, (88), 70 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 23:21:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2024-10-11 23:21:10,318 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 38 [2024-10-11 23:21:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:10,318 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2024-10-11 23:21:10,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 23:21:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2024-10-11 23:21:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 23:21:10,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:10,319 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 23:21:10,319 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:10,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash -328939300, now seen corresponding path program 1 times [2024-10-11 23:21:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:10,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103013310] [2024-10-11 23:21:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:21:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 23:21:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 23:21:10,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:10,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103013310] [2024-10-11 23:21:10,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103013310] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:21:10,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930808792] [2024-10-11 23:21:10,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:10,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:21:10,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:21:10,399 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 23:21:10,401 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 23:21:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 23:21:10,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:21:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 23:21:10,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:21:10,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930808792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:10,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:21:10,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-11 23:21:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438807642] [2024-10-11 23:21:10,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 23:21:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:10,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 23:21:10,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:21:10,484 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 23:21:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:10,508 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-10-11 23:21:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 23:21:10,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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) Word has length 39 [2024-10-11 23:21:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:10,509 INFO L225 Difference]: With dead ends: 105 [2024-10-11 23:21:10,509 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 23:21:10,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 23:21:10,510 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:10,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 23:21:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 23:21:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 60 states have internal predecessors, (76), 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 23:21:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-10-11 23:21:10,513 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 39 [2024-10-11 23:21:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:10,513 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-10-11 23:21:10,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 23:21:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-10-11 23:21:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 23:21:10,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:10,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:10,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 23:21:10,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:21:10,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:10,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:10,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1291571286, now seen corresponding path program 1 times [2024-10-11 23:21:10,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:10,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219279445] [2024-10-11 23:21:10,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:10,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:21:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:21:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219279445] [2024-10-11 23:21:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219279445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:10,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:21:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200681894] [2024-10-11 23:21:10,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:10,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:21:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:10,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:21:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:10,767 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 23:21:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:10,781 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2024-10-11 23:21:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:21:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 39 [2024-10-11 23:21:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:10,782 INFO L225 Difference]: With dead ends: 67 [2024-10-11 23:21:10,782 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 23:21:10,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:21:10,784 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:10,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 23:21:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 23:21:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 59 states have internal predecessors, (75), 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 23:21:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2024-10-11 23:21:10,788 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 39 [2024-10-11 23:21:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:10,789 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2024-10-11 23:21:10,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 23:21:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-10-11 23:21:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 23:21:10,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:10,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 23:21:10,791 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:10,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 664851218, now seen corresponding path program 1 times [2024-10-11 23:21:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691378993] [2024-10-11 23:21:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:21:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 23:21:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 23:21:10,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:10,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691378993] [2024-10-11 23:21:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691378993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:21:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:21:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:21:10,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452975824] [2024-10-11 23:21:10,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:21:10,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:21:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:21:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:21:10,859 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:21:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:10,882 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2024-10-11 23:21:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:21:10,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-10-11 23:21:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:10,883 INFO L225 Difference]: With dead ends: 73 [2024-10-11 23:21:10,883 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 23:21:10,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:21:10,884 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:10,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 214 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 23:21:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 23:21:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 63 states have internal predecessors, (79), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 23:21:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2024-10-11 23:21:10,890 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 44 [2024-10-11 23:21:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:10,890 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2024-10-11 23:21:10,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 23:21:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2024-10-11 23:21:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 23:21:10,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:21:10,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:10,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 23:21:10,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2024-10-11 23:21:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:21:10,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1806325566, now seen corresponding path program 1 times [2024-10-11 23:21:10,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:21:10,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354630979] [2024-10-11 23:21:10,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:10,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:21:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:21:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:21:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 23:21:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 23:21:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:21:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354630979] [2024-10-11 23:21:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354630979] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:21:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15957311] [2024-10-11 23:21:10,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:21:10,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:21:10,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:21:10,982 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 23:21:10,983 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 23:21:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:21:11,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 23:21:11,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:21:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:21:11,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 23:21:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 23:21:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15957311] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 23:21:11,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 23:21:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-11 23:21:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925816204] [2024-10-11 23:21:11,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 23:21:11,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 23:21:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:21:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 23:21:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 23:21:11,112 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 23:21:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:21:11,162 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2024-10-11 23:21:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 23:21:11,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 47 [2024-10-11 23:21:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:21:11,163 INFO L225 Difference]: With dead ends: 74 [2024-10-11 23:21:11,163 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:21:11,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 23:21:11,164 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:21:11,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:21:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:21:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:21:11,164 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 23:21:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:21:11,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-10-11 23:21:11,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:21:11,164 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:21:11,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 23:21:11,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:21:11,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:21:11,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-11 23:21:11,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-11 23:21:11,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-11 23:21:11,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-11 23:21:11,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-11 23:21:11,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-11 23:21:11,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-11 23:21:11,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-11 23:21:11,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-11 23:21:11,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-11 23:21:11,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-11 23:21:11,169 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-11 23:21:11,181 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 23:21:11,372 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,SelfDestructingSolverStorable13 [2024-10-11 23:21:11,375 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:21:11,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:21:11,430 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:21:11,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:21:11 BoogieIcfgContainer [2024-10-11 23:21:11,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:21:11,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:21:11,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:21:11,444 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:21:11,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:21:08" (3/4) ... [2024-10-11 23:21:11,446 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:21:11,448 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:21:11,448 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:21:11,452 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-11 23:21:11,453 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 23:21:11,453 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 23:21:11,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:21:11,535 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:21:11,535 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:21:11,535 INFO L158 Benchmark]: Toolchain (without parser) took 4720.11ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 123.6MB in the beginning and 73.3MB in the end (delta: 50.3MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2024-10-11 23:21:11,535 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:21:11,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 841.95ms. Allocated memory is still 165.7MB. Free memory was 123.6MB in the beginning and 57.3MB in the end (delta: 66.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-11 23:21:11,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.28ms. Allocated memory is still 165.7MB. Free memory was 57.3MB in the beginning and 53.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 23:21:11,536 INFO L158 Benchmark]: Boogie Preprocessor took 36.49ms. Allocated memory is still 165.7MB. Free memory was 53.6MB in the beginning and 51.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:21:11,540 INFO L158 Benchmark]: RCFGBuilder took 432.47ms. Allocated memory is still 165.7MB. Free memory was 51.5MB in the beginning and 114.9MB in the end (delta: -63.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 23:21:11,540 INFO L158 Benchmark]: TraceAbstraction took 3250.68ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 114.8MB in the beginning and 79.5MB in the end (delta: 35.3MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-10-11 23:21:11,540 INFO L158 Benchmark]: Witness Printer took 90.98ms. Allocated memory is still 201.3MB. Free memory was 79.5MB in the beginning and 73.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 23:21:11,541 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.13ms. Allocated memory is still 104.9MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 841.95ms. Allocated memory is still 165.7MB. Free memory was 123.6MB in the beginning and 57.3MB in the end (delta: 66.3MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.28ms. Allocated memory is still 165.7MB. Free memory was 57.3MB in the beginning and 53.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.49ms. Allocated memory is still 165.7MB. Free memory was 53.6MB in the beginning and 51.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.47ms. Allocated memory is still 165.7MB. Free memory was 51.5MB in the beginning and 114.9MB in the end (delta: -63.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3250.68ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 114.8MB in the beginning and 79.5MB in the end (delta: 35.3MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * Witness Printer took 90.98ms. Allocated memory is still 201.3MB. Free memory was 79.5MB in the beginning and 73.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. 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: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: 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, 74 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 2848 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1764 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 1084 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 32 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 594 ConstructedInterpolants, 0 QuantifiedInterpolants, 922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 537 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 124/132 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 12 specifications checked. All of them hold - InvariantResult [Line: 1576]: Loop Invariant Derived loop invariant: (((1 <= h) && (((long) data + 2) == 0)) || ((h == 0) && (0 <= ((long) data + 2)))) - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: (((1 <= k) && (data <= 2147483647)) || ((k == 0) && (data <= 2147483647))) - InvariantResult [Line: 1580]: Loop Invariant Derived loop invariant: (((j == 0) && (((long) data + 2) == 0)) || (((0 <= ((long) data + 3)) && (1 <= j)) && (((long) data + 2) <= 0))) - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: ((((0 <= ((long) 2147483647 + data)) && (i == 0)) && (data <= 2147483647)) || ((1 <= i) && (data <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2024-10-11 23:21:11,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE