./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_17_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 36e05d8c294dc85aa93a5f611f1daa7b5ed13319e2226d62ddc1589e66bfd85e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:16:25,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:16:25,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 06:16:25,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:16:25,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:16:25,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:16:25,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:16:25,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:16:25,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:16:25,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:16:25,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:16:25,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:16:25,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:16:25,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:16:25,706 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:16:25,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:16:25,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:16:25,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 06:16:25,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:16:25,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:16:25,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:16:25,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:16:25,708 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:16:25,709 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:16:25,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:16:25,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:16:25,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:16:25,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:16:25,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:16:25,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:16:25,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:16:25,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:16:25,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:16:25,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:16:25,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:16:25,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 06:16:25,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 06:16:25,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:16:25,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:16:25,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:16:25,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:16:25,714 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36e05d8c294dc85aa93a5f611f1daa7b5ed13319e2226d62ddc1589e66bfd85e [2024-11-17 06:16:25,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:16:25,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:16:25,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:16:25,993 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:16:25,993 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:16:25,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_17_bad.i [2024-11-17 06:16:27,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:16:27,737 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:16:27,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_17_bad.i [2024-11-17 06:16:27,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff37c1fc/49d0e12d1bc14acc9426aed6685f66e9/FLAG7ed576dd8 [2024-11-17 06:16:27,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ff37c1fc/49d0e12d1bc14acc9426aed6685f66e9 [2024-11-17 06:16:27,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:16:27,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:16:27,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:16:27,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:16:27,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:16:27,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:16:27" (1/1) ... [2024-11-17 06:16:27,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c567169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:27, skipping insertion in model container [2024-11-17 06:16:27,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:16:27" (1/1) ... [2024-11-17 06:16:27,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:16:28,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:16:28,662 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:16:28,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:16:28,845 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:16:28,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28 WrapperNode [2024-11-17 06:16:28,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:16:28,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:16:28,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:16:28,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:16:28,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,903 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-17 06:16:28,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:16:28,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:16:28,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:16:28,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:16:28,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,940 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 06:16:28,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,951 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:16:28,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:16:28,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:16:28,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:16:28,968 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (1/1) ... [2024-11-17 06:16:28,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:16:28,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:16:29,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 06:16:29,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 06:16:29,055 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:16:29,055 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:16:29,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:16:29,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:16:29,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:16:29,198 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:16:29,201 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:16:29,353 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-17 06:16:29,354 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:16:29,363 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:16:29,364 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:16:29,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:16:29 BoogieIcfgContainer [2024-11-17 06:16:29,364 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:16:29,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:16:29,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:16:29,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:16:29,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:16:27" (1/3) ... [2024-11-17 06:16:29,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c36441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:16:29, skipping insertion in model container [2024-11-17 06:16:29,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:28" (2/3) ... [2024-11-17 06:16:29,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c36441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:16:29, skipping insertion in model container [2024-11-17 06:16:29,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:16:29" (3/3) ... [2024-11-17 06:16:29,371 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_postinc_17_bad.i [2024-11-17 06:16:29,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:16:29,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 06:16:29,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:16:29,459 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;@25f5633f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:16:29,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 06:16:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 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-11-17 06:16:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 06:16:29,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:16:29,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:16:29,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:16:29,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:16:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash -212966224, now seen corresponding path program 1 times [2024-11-17 06:16:29,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:16:29,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916338363] [2024-11-17 06:16:29,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:16:29,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:16:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:16:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:16:29,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:16:29,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916338363] [2024-11-17 06:16:29,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916338363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:16:29,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:16:29,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 06:16:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214005028] [2024-11-17 06:16:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:16:29,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 06:16:29,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:16:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 06:16:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 06:16:29,885 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 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) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-17 06:16:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:16:29,941 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-11-17 06:16:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 06:16:29,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-11-17 06:16:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:16:29,949 INFO L225 Difference]: With dead ends: 66 [2024-11-17 06:16:29,949 INFO L226 Difference]: Without dead ends: 34 [2024-11-17 06:16:29,951 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-11-17 06:16:29,954 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:16:29,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:16:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-17 06:16:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-17 06:16:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.32) internal successors, (33), 30 states have internal predecessors, (33), 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-11-17 06:16:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-17 06:16:29,995 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 11 [2024-11-17 06:16:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:16:29,996 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-17 06:16:29,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-17 06:16:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-11-17 06:16:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 06:16:29,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:16:29,998 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:16:29,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 06:16:29,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:16:29,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:16:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1102605230, now seen corresponding path program 1 times [2024-11-17 06:16:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:16:30,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917985312] [2024-11-17 06:16:30,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:16:30,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:16:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:30,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:16:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:16:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:16:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917985312] [2024-11-17 06:16:30,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917985312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 06:16:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37183067] [2024-11-17 06:16:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:16:30,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 06:16:30,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:16:30,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 06:16:30,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 06:16:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:30,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 06:16:30,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:16:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:16:30,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:16:30,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37183067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:16:30,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 06:16:30,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-17 06:16:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616228069] [2024-11-17 06:16:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:16:30,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 06:16:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:16:30,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 06:16:30,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 06:16:30,322 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:16:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:16:30,340 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2024-11-17 06:16:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 06:16:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-17 06:16:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:16:30,341 INFO L225 Difference]: With dead ends: 50 [2024-11-17 06:16:30,341 INFO L226 Difference]: Without dead ends: 29 [2024-11-17 06:16:30,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-11-17 06:16:30,342 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:16:30,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:16:30,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-17 06:16:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-17 06:16:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 26 states have internal predecessors, (28), 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-11-17 06:16:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-17 06:16:30,346 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2024-11-17 06:16:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:16:30,346 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-17 06:16:30,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:16:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-17 06:16:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 06:16:30,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:16:30,347 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:16:30,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 06:16:30,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 06:16:30,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:16:30,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:16:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash 195500677, now seen corresponding path program 1 times [2024-11-17 06:16:30,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:16:30,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674115983] [2024-11-17 06:16:30,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:16:30,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:16:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:30,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 06:16:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:16:30,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 06:16:30,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674115983] [2024-11-17 06:16:30,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674115983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:16:30,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:16:30,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 06:16:30,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734679969] [2024-11-17 06:16:30,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:16:30,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 06:16:30,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 06:16:30,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 06:16:30,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 06:16:30,631 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:16:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:16:30,654 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-11-17 06:16:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 06:16:30,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-17 06:16:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:16:30,655 INFO L225 Difference]: With dead ends: 34 [2024-11-17 06:16:30,656 INFO L226 Difference]: Without dead ends: 21 [2024-11-17 06:16:30,656 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-11-17 06:16:30,657 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:16:30,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:16:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-17 06:16:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 06:16:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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-11-17 06:16:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-17 06:16:30,668 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2024-11-17 06:16:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:16:30,668 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-17 06:16:30,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 06:16:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-17 06:16:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 06:16:30,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:16:30,673 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:16:30,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 06:16:30,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:16:30,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:16:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1765553677, now seen corresponding path program 1 times [2024-11-17 06:16:30,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 06:16:30,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3269900] [2024-11-17 06:16:30,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:16:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 06:16:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:16:30,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:16:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:16:30,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 06:16:30,734 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:16:30,735 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 06:16:30,737 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 06:16:30,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 06:16:30,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 06:16:30,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 06:16:30,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 06:16:30,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 06:16:30,745 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-17 06:16:30,774 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:16:30,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:16:30 BoogieIcfgContainer [2024-11-17 06:16:30,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:16:30,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:16:30,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:16:30,780 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:16:30,780 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:16:29" (3/4) ... [2024-11-17 06:16:30,783 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:16:30,784 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:16:30,785 INFO L158 Benchmark]: Toolchain (without parser) took 2984.32ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 60.4MB in the beginning and 85.6MB in the end (delta: -25.3MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-17 06:16:30,786 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:16:30,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1042.34ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 60.1MB in the beginning and 90.1MB in the end (delta: -30.0MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-17 06:16:30,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.41ms. Allocated memory is still 174.1MB. Free memory was 90.1MB in the beginning and 87.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 06:16:30,790 INFO L158 Benchmark]: Boogie Preprocessor took 58.97ms. Allocated memory is still 174.1MB. Free memory was 87.0MB in the beginning and 85.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:16:30,790 INFO L158 Benchmark]: IcfgBuilder took 400.64ms. Allocated memory is still 174.1MB. Free memory was 85.9MB in the beginning and 72.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 06:16:30,790 INFO L158 Benchmark]: TraceAbstraction took 1413.47ms. Allocated memory is still 174.1MB. Free memory was 71.2MB in the beginning and 86.7MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:16:30,790 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 174.1MB. Free memory was 86.7MB in the beginning and 85.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:16:30,792 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.17ms. Allocated memory is still 134.2MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1042.34ms. Allocated memory was 134.2MB in the beginning and 174.1MB in the end (delta: 39.8MB). Free memory was 60.1MB in the beginning and 90.1MB in the end (delta: -30.0MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.41ms. Allocated memory is still 174.1MB. Free memory was 90.1MB in the beginning and 87.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.97ms. Allocated memory is still 174.1MB. Free memory was 87.0MB in the beginning and 85.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 400.64ms. Allocated memory is still 174.1MB. Free memory was 85.9MB in the beginning and 72.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1413.47ms. Allocated memory is still 174.1MB. Free memory was 71.2MB in the beginning and 86.7MB in the end (delta: -15.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 174.1MB. Free memory was 86.7MB in the beginning and 85.6MB in the end (delta: 1.0MB). There was no memory consumed. 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 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_max_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] data = 0x7fffffff [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 [L1560] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 77 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 6/8 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 06:16:30,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_17_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 36e05d8c294dc85aa93a5f611f1daa7b5ed13319e2226d62ddc1589e66bfd85e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 06:16:32,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 06:16:33,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 06:16:33,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 06:16:33,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 06:16:33,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 06:16:33,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 06:16:33,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 06:16:33,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 06:16:33,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 06:16:33,100 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 06:16:33,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 06:16:33,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 06:16:33,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 06:16:33,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 06:16:33,106 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 06:16:33,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 06:16:33,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 06:16:33,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 06:16:33,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 06:16:33,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 06:16:33,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 06:16:33,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 06:16:33,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 06:16:33,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 06:16:33,110 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 06:16:33,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 06:16:33,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 06:16:33,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 06:16:33,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 06:16:33,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 06:16:33,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 06:16:33,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 06:16:33,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 06:16:33,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:16:33,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 06:16:33,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 06:16:33,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 06:16:33,114 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 06:16:33,114 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 06:16:33,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 06:16:33,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 06:16:33,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 06:16:33,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 06:16:33,116 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36e05d8c294dc85aa93a5f611f1daa7b5ed13319e2226d62ddc1589e66bfd85e [2024-11-17 06:16:33,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 06:16:33,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 06:16:33,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 06:16:33,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 06:16:33,481 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 06:16:33,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_17_bad.i [2024-11-17 06:16:35,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 06:16:35,390 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 06:16:35,390 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_postinc_17_bad.i [2024-11-17 06:16:35,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c3df00f/e091249ce61b4237a780046edc4239a2/FLAG60db3b285 [2024-11-17 06:16:35,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19c3df00f/e091249ce61b4237a780046edc4239a2 [2024-11-17 06:16:35,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 06:16:35,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 06:16:35,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 06:16:35,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 06:16:35,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 06:16:35,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:16:35" (1/1) ... [2024-11-17 06:16:35,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc2df38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:35, skipping insertion in model container [2024-11-17 06:16:35,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 06:16:35" (1/1) ... [2024-11-17 06:16:35,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 06:16:36,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:16:36,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 06:16:36,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 06:16:36,550 INFO L204 MainTranslator]: Completed translation [2024-11-17 06:16:36,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36 WrapperNode [2024-11-17 06:16:36,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 06:16:36,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 06:16:36,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 06:16:36,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 06:16:36,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,613 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-17 06:16:36,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 06:16:36,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 06:16:36,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 06:16:36,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 06:16:36,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,644 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 06:16:36,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 06:16:36,661 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 06:16:36,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 06:16:36,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 06:16:36,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (1/1) ... [2024-11-17 06:16:36,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 06:16:36,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 06:16:36,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 06:16:36,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 06:16:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 06:16:36,752 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 06:16:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 06:16:36,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 06:16:36,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 06:16:36,914 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 06:16:36,916 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 06:16:37,071 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-17 06:16:37,071 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 06:16:37,084 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 06:16:37,085 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 06:16:37,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:16:37 BoogieIcfgContainer [2024-11-17 06:16:37,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 06:16:37,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 06:16:37,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 06:16:37,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 06:16:37,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 06:16:35" (1/3) ... [2024-11-17 06:16:37,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee17134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:16:37, skipping insertion in model container [2024-11-17 06:16:37,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 06:16:36" (2/3) ... [2024-11-17 06:16:37,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee17134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 06:16:37, skipping insertion in model container [2024-11-17 06:16:37,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:16:37" (3/3) ... [2024-11-17 06:16:37,095 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_postinc_17_bad.i [2024-11-17 06:16:37,111 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 06:16:37,112 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-17 06:16:37,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 06:16:37,203 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;@afe6074, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 06:16:37,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-17 06:16:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 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-11-17 06:16:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 06:16:37,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:16:37,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:16:37,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:16:37,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:16:37,224 INFO L85 PathProgramCache]: Analyzing trace with hash -212966224, now seen corresponding path program 1 times [2024-11-17 06:16:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:16:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136416950] [2024-11-17 06:16:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:16:37,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 06:16:37,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:16:37,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 06:16:37,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 06:16:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:37,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 06:16:37,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:16:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:16:37,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:16:37,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:16:37,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136416950] [2024-11-17 06:16:37,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136416950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:16:37,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:16:37,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 06:16:37,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503341878] [2024-11-17 06:16:37,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:16:37,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 06:16:37,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:16:37,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 06:16:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 06:16:37,422 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 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) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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-11-17 06:16:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:16:37,442 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-17 06:16:37,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 06:16:37,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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 11 [2024-11-17 06:16:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:16:37,452 INFO L225 Difference]: With dead ends: 57 [2024-11-17 06:16:37,453 INFO L226 Difference]: Without dead ends: 26 [2024-11-17 06:16:37,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 06:16:37,460 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:16:37,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:16:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-17 06:16:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-17 06:16:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 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-11-17 06:16:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-17 06:16:37,501 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2024-11-17 06:16:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:16:37,502 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-17 06:16:37,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 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-11-17 06:16:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-17 06:16:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 06:16:37,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:16:37,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:16:37,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 06:16:37,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 06:16:37,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:16:37,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:16:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1987981646, now seen corresponding path program 1 times [2024-11-17 06:16:37,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:16:37,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669735101] [2024-11-17 06:16:37,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:16:37,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 06:16:37,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:16:37,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 06:16:37,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 06:16:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:37,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 06:16:37,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:16:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:16:37,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 06:16:37,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:16:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669735101] [2024-11-17 06:16:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669735101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 06:16:37,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 06:16:37,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 06:16:37,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460089209] [2024-11-17 06:16:37,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 06:16:37,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 06:16:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:16:37,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 06:16:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 06:16:37,864 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-11-17 06:16:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:16:37,890 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-11-17 06:16:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 06:16:37,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-11-17 06:16:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:16:37,892 INFO L225 Difference]: With dead ends: 44 [2024-11-17 06:16:37,892 INFO L226 Difference]: Without dead ends: 31 [2024-11-17 06:16:37,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 06:16:37,894 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 06:16:37,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:16:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-17 06:16:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-17 06:16:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 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-11-17 06:16:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-17 06:16:37,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 12 [2024-11-17 06:16:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:16:37,903 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-17 06:16:37,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-11-17 06:16:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-17 06:16:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 06:16:37,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:16:37,905 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:16:37,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 06:16:38,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 06:16:38,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:16:38,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:16:38,110 INFO L85 PathProgramCache]: Analyzing trace with hash 178976236, now seen corresponding path program 1 times [2024-11-17 06:16:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:16:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780671906] [2024-11-17 06:16:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:16:38,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 06:16:38,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:16:38,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 06:16:38,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 06:16:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 06:16:38,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 06:16:38,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 06:16:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:16:38,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 06:16:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 06:16:38,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 06:16:38,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780671906] [2024-11-17 06:16:38,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780671906] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 06:16:38,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 06:16:38,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 06:16:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293509169] [2024-11-17 06:16:38,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 06:16:38,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 06:16:38,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 06:16:38,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 06:16:38,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 06:16:38,309 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-11-17 06:16:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 06:16:38,371 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-11-17 06:16:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 06:16:38,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 17 [2024-11-17 06:16:38,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 06:16:38,374 INFO L225 Difference]: With dead ends: 45 [2024-11-17 06:16:38,374 INFO L226 Difference]: Without dead ends: 27 [2024-11-17 06:16:38,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 06:16:38,377 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 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-11-17 06:16:38,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 06:16:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-17 06:16:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-17 06:16:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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-11-17 06:16:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-17 06:16:38,383 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2024-11-17 06:16:38,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 06:16:38,383 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-17 06:16:38,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-11-17 06:16:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-17 06:16:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 06:16:38,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 06:16:38,391 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 06:16:38,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 06:16:38,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 06:16:38,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-17 06:16:38,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 06:16:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1765553677, now seen corresponding path program 1 times [2024-11-17 06:16:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 06:16:38,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796601293] [2024-11-17 06:16:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 06:16:38,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 06:16:38,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 06:16:38,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 06:16:38,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 06:16:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:16:38,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 06:16:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 06:16:38,708 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 06:16:38,708 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 06:16:38,709 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-17 06:16:38,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-17 06:16:38,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-17 06:16:38,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-17 06:16:38,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-17 06:16:38,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-17 06:16:38,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 06:16:38,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 06:16:38,919 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-17 06:16:38,945 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 06:16:38,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 06:16:38 BoogieIcfgContainer [2024-11-17 06:16:38,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 06:16:38,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 06:16:38,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 06:16:38,948 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 06:16:38,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 06:16:37" (3/4) ... [2024-11-17 06:16:38,952 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 06:16:38,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 06:16:38,955 INFO L158 Benchmark]: Toolchain (without parser) took 3502.86ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 46.6MB in the beginning and 73.5MB in the end (delta: -26.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:16:38,957 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:16:38,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1098.93ms. Allocated memory is still 83.9MB. Free memory was 46.4MB in the beginning and 51.7MB in the end (delta: -5.4MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-17 06:16:38,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.17ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 48.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 06:16:38,958 INFO L158 Benchmark]: Boogie Preprocessor took 46.28ms. Allocated memory is still 83.9MB. Free memory was 48.6MB in the beginning and 46.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 06:16:38,958 INFO L158 Benchmark]: IcfgBuilder took 424.36ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 31.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 06:16:38,959 INFO L158 Benchmark]: TraceAbstraction took 1860.62ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 31.3MB in the beginning and 74.3MB in the end (delta: -43.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:16:38,959 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 73.5MB in the end (delta: 757.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 06:16:38,961 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.20ms. Allocated memory is still 58.7MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1098.93ms. Allocated memory is still 83.9MB. Free memory was 46.4MB in the beginning and 51.7MB in the end (delta: -5.4MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.17ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 48.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.28ms. Allocated memory is still 83.9MB. Free memory was 48.6MB in the beginning and 46.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 424.36ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 31.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1860.62ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 31.3MB in the beginning and 74.3MB in the end (delta: -43.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 73.5MB in the end (delta: 757.4kB). There was no memory consumed. 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 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_max_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] data = 0x7fffffff [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 [L1560] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 253 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 82 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 4/8 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-17 06:16:38,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample