./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_05_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f 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_rand_preinc_05_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 3e5623dde08e4bb97fb58239dc69624a7769791ffdf0b1cffdd444ece7ed4a6a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:15:14,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:15:14,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 19:15:15,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:15:15,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:15:15,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:15:15,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:15:15,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:15:15,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:15:15,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:15:15,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:15:15,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:15:15,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:15:15,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:15:15,023 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:15:15,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:15:15,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:15:15,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 19:15:15,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:15:15,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:15:15,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:15:15,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:15:15,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:15:15,027 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:15:15,027 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:15:15,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:15:15,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:15:15,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:15:15,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:15:15,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:15:15,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:15:15,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:15:15,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:15:15,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:15:15,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:15:15,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 19:15:15,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 19:15:15,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:15:15,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:15:15,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:15:15,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:15:15,030 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 -> 3e5623dde08e4bb97fb58239dc69624a7769791ffdf0b1cffdd444ece7ed4a6a [2024-11-12 19:15:15,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:15:15,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:15:15,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:15:15,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:15:15,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:15:15,257 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_rand_preinc_05_bad.i [2024-11-12 19:15:16,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:15:16,758 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:15:16,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_05_bad.i [2024-11-12 19:15:16,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7c994a5/35cbdeaf76de4d9ea78ac97772dfa907/FLAG4f540a3d2 [2024-11-12 19:15:16,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7c994a5/35cbdeaf76de4d9ea78ac97772dfa907 [2024-11-12 19:15:16,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:15:16,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:15:16,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:15:16,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:15:16,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:15:16,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:16" (1/1) ... [2024-11-12 19:15:16,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f53a054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:16, skipping insertion in model container [2024-11-12 19:15:16,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:16" (1/1) ... [2024-11-12 19:15:16,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:15:17,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:15:17,400 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:15:17,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:15:17,589 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:15:17,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17 WrapperNode [2024-11-12 19:15:17,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:15:17,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:15:17,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:15:17,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:15:17,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,636 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103 [2024-11-12 19:15:17,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:15:17,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:15:17,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:15:17,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:15:17,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,653 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 19:15:17,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:15:17,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:15:17,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:15:17,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:15:17,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (1/1) ... [2024-11-12 19:15:17,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:15:17,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:15:17,694 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-12 19:15:17,696 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-12 19:15:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:15:17,725 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:15:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:15:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:15:17,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:15:17,823 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:15:17,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:15:17,996 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-12 19:15:17,996 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:15:18,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:15:18,006 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 19:15:18,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:18 BoogieIcfgContainer [2024-11-12 19:15:18,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:15:18,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:15:18,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:15:18,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:15:18,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:15:16" (1/3) ... [2024-11-12 19:15:18,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abcf6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:18, skipping insertion in model container [2024-11-12 19:15:18,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:17" (2/3) ... [2024-11-12 19:15:18,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2abcf6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:18, skipping insertion in model container [2024-11-12 19:15:18,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:18" (3/3) ... [2024-11-12 19:15:18,015 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_05_bad.i [2024-11-12 19:15:18,028 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:15:18,028 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 19:15:18,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:15:18,071 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;@563b0b84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:15:18,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 19:15:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 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-12 19:15:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 19:15:18,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:18,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:18,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:18,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:18,085 INFO L85 PathProgramCache]: Analyzing trace with hash 433338487, now seen corresponding path program 1 times [2024-11-12 19:15:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:15:18,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530435541] [2024-11-12 19:15:18,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:15:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:15:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:18,434 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-12 19:15:18,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:15:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530435541] [2024-11-12 19:15:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530435541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:18,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:18,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 19:15:18,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055501257] [2024-11-12 19:15:18,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:18,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 19:15:18,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:15:18,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 19:15:18,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 19:15:18,459 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 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 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-12 19:15:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:18,586 INFO L93 Difference]: Finished difference Result 87 states and 120 transitions. [2024-11-12 19:15:18,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 19:15:18,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-12 19:15:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:18,593 INFO L225 Difference]: With dead ends: 87 [2024-11-12 19:15:18,593 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 19:15:18,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 19:15:18,597 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 58 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:15:18,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 193 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 19:15:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 19:15:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 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-12 19:15:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-12 19:15:18,634 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 11 [2024-11-12 19:15:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:18,635 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-12 19:15:18,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-12 19:15:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-12 19:15:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 19:15:18,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:18,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:18,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 19:15:18,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:18,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash -423377772, now seen corresponding path program 1 times [2024-11-12 19:15:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:15:18,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385786413] [2024-11-12 19:15:18,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:15:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:18,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:15:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:18,830 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-12 19:15:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:15:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385786413] [2024-11-12 19:15:18,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385786413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:18,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:18,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 19:15:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334019580] [2024-11-12 19:15:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:18,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 19:15:18,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:15:18,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 19:15:18,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 19:15:18,836 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-12 19:15:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:18,908 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-11-12 19:15:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 19:15:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-12 19:15:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:18,909 INFO L225 Difference]: With dead ends: 42 [2024-11-12 19:15:18,910 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 19:15:18,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 19:15:18,912 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 40 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:15:18,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 154 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 19:15:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-12 19:15:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 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-12 19:15:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-12 19:15:18,919 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 17 [2024-11-12 19:15:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:18,919 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-12 19:15:18,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-12 19:15:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-12 19:15:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 19:15:18,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:18,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:18,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 19:15:18,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:18,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1868440622, now seen corresponding path program 1 times [2024-11-12 19:15:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:15:18,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447109137] [2024-11-12 19:15:18,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:18,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:15:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:18,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:15:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:19,003 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-12 19:15:19,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:15:19,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447109137] [2024-11-12 19:15:19,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447109137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:19,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:19,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:15:19,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244525616] [2024-11-12 19:15:19,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:19,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:15:19,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:15:19,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:15:19,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:19,005 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-12 19:15:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:19,013 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-12 19:15:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:15:19,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-12 19:15:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:19,015 INFO L225 Difference]: With dead ends: 40 [2024-11-12 19:15:19,016 INFO L226 Difference]: Without dead ends: 39 [2024-11-12 19:15:19,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:19,017 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:15:19,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-12 19:15:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-12 19:15:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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-12 19:15:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-11-12 19:15:19,024 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 17 [2024-11-12 19:15:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:19,025 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-11-12 19:15:19,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-12 19:15:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-11-12 19:15:19,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 19:15:19,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:19,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:19,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 19:15:19,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:19,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:19,027 INFO L85 PathProgramCache]: Analyzing trace with hash -239808910, now seen corresponding path program 1 times [2024-11-12 19:15:19,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:15:19,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73151614] [2024-11-12 19:15:19,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:15:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:15:19,045 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:15:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:15:19,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 19:15:19,073 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:15:19,073 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 19:15:19,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 19:15:19,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 19:15:19,077 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 19:15:19,098 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:15:19,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:15:19 BoogieIcfgContainer [2024-11-12 19:15:19,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:15:19,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:15:19,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:15:19,101 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:15:19,101 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:18" (3/4) ... [2024-11-12 19:15:19,105 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:15:19,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:15:19,108 INFO L158 Benchmark]: Toolchain (without parser) took 2310.42ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 140.8MB in the beginning and 131.9MB in the end (delta: 8.8MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-11-12 19:15:19,108 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory was 87.2MB in the beginning and 87.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:15:19,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 795.66ms. Allocated memory is still 176.2MB. Free memory was 140.8MB in the beginning and 126.9MB in the end (delta: 13.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-12 19:15:19,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.11ms. Allocated memory is still 176.2MB. Free memory was 126.9MB in the beginning and 123.0MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:15:19,110 INFO L158 Benchmark]: Boogie Preprocessor took 24.13ms. Allocated memory is still 176.2MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:15:19,110 INFO L158 Benchmark]: RCFGBuilder took 345.80ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 104.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 19:15:19,110 INFO L158 Benchmark]: TraceAbstraction took 1091.81ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 104.1MB in the beginning and 131.9MB in the end (delta: -27.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-12 19:15:19,110 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 220.2MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:15:19,112 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.14ms. Allocated memory is still 125.8MB. Free memory was 87.2MB in the beginning and 87.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 795.66ms. Allocated memory is still 176.2MB. Free memory was 140.8MB in the beginning and 126.9MB in the end (delta: 13.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.11ms. Allocated memory is still 176.2MB. Free memory was 126.9MB in the beginning and 123.0MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.13ms. Allocated memory is still 176.2MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.80ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 104.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1091.81ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 104.1MB in the beginning and 131.9MB in the end (delta: -27.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 220.2MB. Free memory is still 131.9MB. 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: 1561]: 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 1570. 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); [L1548] static int staticTrue = 1; [L1549] static int staticFalse = 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, staticFalse=0, staticTrue=1] [L1570] 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, staticFalse=0, staticTrue=1] [L1414] COND TRUE line != ((void *)0) [L1570] 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, staticFalse=0, staticTrue=1] [L1571] CALL CWE190_Integer_Overflow__int_rand_preinc_05_bad() [L1552] int data; [L1553] data = 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, staticFalse=0, staticTrue=1] [L1554] COND TRUE \read(staticTrue) [L1556] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1556] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) 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, staticFalse=0, staticTrue=1] [L1556] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() 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, staticFalse=0, staticTrue=1] [L1556] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 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, staticFalse=0, staticTrue=1] [L1556] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1558] COND TRUE \read(staticTrue) 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, staticFalse=0, staticTrue=1] [L1561] ++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, staticFalse=0, staticTrue=1] - UnprovableResult [Line: 1561]: 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, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 399 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 265 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 134 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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-12 19:15:19,135 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 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_rand_preinc_05_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 3e5623dde08e4bb97fb58239dc69624a7769791ffdf0b1cffdd444ece7ed4a6a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:15:20,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:15:20,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 19:15:20,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:15:20,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:15:20,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 19:15:20,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:15:20,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:15:20,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:15:20,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:15:20,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:15:20,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:15:20,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:15:20,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:15:20,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:15:20,952 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:15:20,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:15:20,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:15:20,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:15:20,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:15:20,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:15:20,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:15:20,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 19:15:20,954 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 19:15:20,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:15:20,955 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:15:20,955 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 19:15:20,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:15:20,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:15:20,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:15:20,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:15:20,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:15:20,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:15:20,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:15:20,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:15:20,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:15:20,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:15:20,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:15:20,968 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 19:15:20,968 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 19:15:20,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:15:20,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:15:20,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:15:20,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:15:20,969 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 -> 3e5623dde08e4bb97fb58239dc69624a7769791ffdf0b1cffdd444ece7ed4a6a [2024-11-12 19:15:21,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:15:21,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:15:21,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:15:21,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:15:21,222 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:15:21,223 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_rand_preinc_05_bad.i [2024-11-12 19:15:22,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:15:22,738 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:15:22,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_05_bad.i [2024-11-12 19:15:22,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050eaa8dc/c16035cd5882440fbd30e1289beba03f/FLAG7a5c834c6 [2024-11-12 19:15:22,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/050eaa8dc/c16035cd5882440fbd30e1289beba03f [2024-11-12 19:15:22,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:15:22,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:15:22,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:15:22,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:15:22,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:15:22,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:22" (1/1) ... [2024-11-12 19:15:22,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ec9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:22, skipping insertion in model container [2024-11-12 19:15:22,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:22" (1/1) ... [2024-11-12 19:15:22,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:15:23,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:15:23,472 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:15:23,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:15:23,615 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:15:23,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23 WrapperNode [2024-11-12 19:15:23,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:15:23,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:15:23,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:15:23,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:15:23,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,665 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-12 19:15:23,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:15:23,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:15:23,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:15:23,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:15:23,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,686 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 19:15:23,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:15:23,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:15:23,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:15:23,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:15:23,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (1/1) ... [2024-11-12 19:15:23,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:15:23,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:15:23,720 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-12 19:15:23,722 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-12 19:15:23,750 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:15:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:15:23,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:15:23,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:15:23,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:15:23,875 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:15:23,876 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:15:23,975 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-12 19:15:23,975 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:15:23,985 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:15:23,985 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 19:15:23,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:23 BoogieIcfgContainer [2024-11-12 19:15:23,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:15:23,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:15:23,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:15:23,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:15:23,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:15:22" (1/3) ... [2024-11-12 19:15:23,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a33e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:23, skipping insertion in model container [2024-11-12 19:15:23,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:23" (2/3) ... [2024-11-12 19:15:23,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a33e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:23, skipping insertion in model container [2024-11-12 19:15:23,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:23" (3/3) ... [2024-11-12 19:15:23,994 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_05_bad.i [2024-11-12 19:15:24,009 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:15:24,009 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 19:15:24,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:15:24,067 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;@6d4c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:15:24,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 19:15:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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-12 19:15:24,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 19:15:24,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:24,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:24,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1654475935, now seen corresponding path program 1 times [2024-11-12 19:15:24,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:15:24,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188625674] [2024-11-12 19:15:24,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:24,099 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-12 19:15:24,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:15:24,102 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-12 19:15:24,103 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-12 19:15:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:24,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 19:15:24,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:15:24,206 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-12 19:15:24,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:15:24,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:15:24,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188625674] [2024-11-12 19:15:24,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188625674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:24,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:24,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 19:15:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37515688] [2024-11-12 19:15:24,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:24,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 19:15:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:15:24,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 19:15:24,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 19:15:24,229 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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-12 19:15:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:24,239 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-11-12 19:15:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 19:15:24,241 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-12 19:15:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:24,245 INFO L225 Difference]: With dead ends: 23 [2024-11-12 19:15:24,245 INFO L226 Difference]: Without dead ends: 15 [2024-11-12 19:15:24,247 INFO L434 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-12 19:15:24,249 INFO L435 NwaCegarLoop]: 26 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, 26 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-12 19:15:24,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-12 19:15:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-12 19:15:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-12 19:15:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-12 19:15:24,273 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-11-12 19:15:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:24,273 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-12 19:15:24,273 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-12 19:15:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-12 19:15:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 19:15:24,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:24,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:24,278 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-12 19:15:24,475 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-12 19:15:24,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:24,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash -250853505, now seen corresponding path program 1 times [2024-11-12 19:15:24,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:15:24,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560234804] [2024-11-12 19:15:24,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:24,479 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-12 19:15:24,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:15:24,481 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-12 19:15:24,482 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-12 19:15:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:24,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 19:15:24,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:15:24,596 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-12 19:15:24,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:15:24,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:15:24,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560234804] [2024-11-12 19:15:24,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560234804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:24,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:24,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:15:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060274374] [2024-11-12 19:15:24,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:24,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:15:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:15:24,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:15:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:24,601 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-12 19:15:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:24,611 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-12 19:15:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:15:24,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-12 19:15:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:24,612 INFO L225 Difference]: With dead ends: 19 [2024-11-12 19:15:24,612 INFO L226 Difference]: Without dead ends: 15 [2024-11-12 19:15:24,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:24,613 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:15:24,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-12 19:15:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-12 19:15:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-12 19:15:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-12 19:15:24,619 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2024-11-12 19:15:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:24,619 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-12 19:15:24,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-12 19:15:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-12 19:15:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 19:15:24,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:24,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:24,626 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-12 19:15:24,823 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-12 19:15:24,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:24,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash -819187548, now seen corresponding path program 1 times [2024-11-12 19:15:24,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:15:24,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486592509] [2024-11-12 19:15:24,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:24,825 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-12 19:15:24,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:15:24,828 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-12 19:15:24,829 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-12 19:15:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:15:24,889 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:15:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:15:24,938 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 19:15:24,938 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:15:24,940 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 19:15:24,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 19:15:24,945 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-12 19:15:25,142 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-12 19:15:25,145 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 19:15:25,167 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:15:25,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:15:25 BoogieIcfgContainer [2024-11-12 19:15:25,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:15:25,169 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:15:25,170 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:15:25,170 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:15:25,170 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:23" (3/4) ... [2024-11-12 19:15:25,172 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:15:25,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:15:25,174 INFO L158 Benchmark]: Toolchain (without parser) took 2397.17ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 57.0MB in the beginning and 64.3MB in the end (delta: -7.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-12 19:15:25,174 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 56.6MB. Free memory was 31.5MB in the beginning and 31.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:15:25,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 838.27ms. Allocated memory is still 77.6MB. Free memory was 56.7MB in the beginning and 31.0MB in the end (delta: 25.7MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2024-11-12 19:15:25,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.48ms. Allocated memory is still 77.6MB. Free memory was 31.0MB in the beginning and 28.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:15:25,175 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 77.6MB. Free memory was 28.0MB in the beginning and 48.3MB in the end (delta: -20.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-12 19:15:25,180 INFO L158 Benchmark]: RCFGBuilder took 287.32ms. Allocated memory is still 77.6MB. Free memory was 47.9MB in the beginning and 34.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 19:15:25,180 INFO L158 Benchmark]: TraceAbstraction took 1182.10ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 33.2MB in the beginning and 65.0MB in the end (delta: -31.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-12 19:15:25,181 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 64.3MB in the end (delta: 655.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:15:25,182 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.83ms. Allocated memory is still 56.6MB. Free memory was 31.5MB in the beginning and 31.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 838.27ms. Allocated memory is still 77.6MB. Free memory was 56.7MB in the beginning and 31.0MB in the end (delta: 25.7MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.48ms. Allocated memory is still 77.6MB. Free memory was 31.0MB in the beginning and 28.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 77.6MB. Free memory was 28.0MB in the beginning and 48.3MB in the end (delta: -20.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * RCFGBuilder took 287.32ms. Allocated memory is still 77.6MB. Free memory was 47.9MB in the beginning and 34.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1182.10ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 33.2MB in the beginning and 65.0MB in the end (delta: -31.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 94.4MB. Free memory was 65.0MB in the beginning and 64.3MB in the end (delta: 655.5kB). 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: 1561]: 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 1570. 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); [L1548] static int staticTrue = 1; [L1549] static int staticFalse = 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, staticFalse=0, staticTrue=1] [L1570] 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, staticFalse=0, staticTrue=1] [L1414] COND TRUE line != ((void *)0) [L1570] 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, staticFalse=0, staticTrue=1] [L1571] CALL CWE190_Integer_Overflow__int_rand_preinc_05_bad() [L1552] int data; [L1553] data = 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, staticFalse=0, staticTrue=1] [L1554] COND TRUE \read(staticTrue) [L1556] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1556] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 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, staticFalse=0, staticTrue=1] [L1556] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1558] COND TRUE \read(staticTrue) 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, staticFalse=0, staticTrue=1] [L1561] ++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, staticFalse=0, staticTrue=1] - UnprovableResult [Line: 1561]: 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, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 40 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 37 SizeOfPredicates, 0 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-12 19:15:25,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample