./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_10_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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_10_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 30377fc63eb9776a40bd65ec000b18c9cb00e137b1dba2618a63567142b1b886 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:42:16,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:42:16,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-09 13:42:16,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:42:16,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:42:16,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:42:16,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:42:16,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:42:16,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:42:16,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:42:16,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:42:16,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:42:16,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:42:16,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:42:16,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:42:16,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:42:16,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:42:16,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 13:42:16,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:42:16,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:42:16,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:42:16,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:42:16,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:42:16,365 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:42:16,365 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:42:16,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:42:16,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:42:16,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:42:16,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:42:16,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:42:16,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:42:16,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:42:16,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:42:16,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:42:16,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:42:16,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 13:42:16,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 13:42:16,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:42:16,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:42:16,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:42:16,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:42:16,369 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 -> 30377fc63eb9776a40bd65ec000b18c9cb00e137b1dba2618a63567142b1b886 [2024-11-09 13:42:16,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:42:16,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:42:16,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:42:16,643 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:42:16,644 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:42:16,645 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_10_bad.i [2024-11-09 13:42:18,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:42:18,526 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:42:18,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_10_bad.i [2024-11-09 13:42:18,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4aaed9c/22bfa0b2f8ac4909a6cec45fa90b79be/FLAG228729d60 [2024-11-09 13:42:18,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4aaed9c/22bfa0b2f8ac4909a6cec45fa90b79be [2024-11-09 13:42:18,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:42:18,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:42:18,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:42:18,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:42:18,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:42:18,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:42:18" (1/1) ... [2024-11-09 13:42:18,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d60a302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:18, skipping insertion in model container [2024-11-09 13:42:18,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:42:18" (1/1) ... [2024-11-09 13:42:18,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:42:19,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:42:19,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:42:19,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:42:19,868 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:42:19,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19 WrapperNode [2024-11-09 13:42:19,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:42:19,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:42:19,871 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:42:19,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:42:19,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,929 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2024-11-09 13:42:19,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:42:19,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:42:19,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:42:19,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:42:19,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,954 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 13:42:19,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:42:19,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:42:19,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:42:19,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:42:19,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (1/1) ... [2024-11-09 13:42:19,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:42:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:42:20,013 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-09 13:42:20,015 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-09 13:42:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:42:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:42:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:42:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:42:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:42:20,182 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:42:20,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:42:20,387 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-09 13:42:20,387 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:42:20,404 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:42:20,404 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:42:20,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:42:20 BoogieIcfgContainer [2024-11-09 13:42:20,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:42:20,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:42:20,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:42:20,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:42:20,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:42:18" (1/3) ... [2024-11-09 13:42:20,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c117123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:42:20, skipping insertion in model container [2024-11-09 13:42:20,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:19" (2/3) ... [2024-11-09 13:42:20,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c117123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:42:20, skipping insertion in model container [2024-11-09 13:42:20,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:42:20" (3/3) ... [2024-11-09 13:42:20,415 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_10_bad.i [2024-11-09 13:42:20,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:42:20,430 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:42:20,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:42:20,488 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;@7f1effa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:42:20,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:42:20,493 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-09 13:42:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 13:42:20,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:42:20,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:42:20,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:42:20,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:42:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash 433338487, now seen corresponding path program 1 times [2024-11-09 13:42:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:42:20,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798323323] [2024-11-09 13:42:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:42:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:42:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:42:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:42:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:42:20,908 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-09 13:42:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:42:20,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798323323] [2024-11-09 13:42:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798323323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:42:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:42:20,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 13:42:20,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15968721] [2024-11-09 13:42:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:42:20,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:42:20,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:42:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:42:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:42:20,998 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 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-09 13:42:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:42:21,026 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-09 13:42:21,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:42:21,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-09 13:42:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:42:21,036 INFO L225 Difference]: With dead ends: 59 [2024-11-09 13:42:21,036 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 13:42:21,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:42:21,043 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 13:42:21,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:42:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 13:42:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 13:42:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 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-09 13:42:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-09 13:42:21,084 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 11 [2024-11-09 13:42:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:42:21,085 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-09 13:42:21,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-09 13:42:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-09 13:42:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 13:42:21,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:42:21,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:42:21,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 13:42:21,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:42:21,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:42:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash -423377772, now seen corresponding path program 1 times [2024-11-09 13:42:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:42:21,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586625713] [2024-11-09 13:42:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:42:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:42:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:42:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:42:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:42:21,414 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-09 13:42:21,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:42:21,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586625713] [2024-11-09 13:42:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586625713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:42:21,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:42:21,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 13:42:21,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168289212] [2024-11-09 13:42:21,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:42:21,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 13:42:21,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:42:21,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 13:42:21,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 13:42:21,421 INFO L87 Difference]: Start difference. First operand 36 states and 49 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-09 13:42:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:42:21,529 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-09 13:42:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 13:42:21,529 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-09 13:42:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:42:21,531 INFO L225 Difference]: With dead ends: 42 [2024-11-09 13:42:21,531 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 13:42:21,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 13:42:21,532 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 159 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 13:42:21,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 159 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 13:42:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 13:42:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-09 13:42:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 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-09 13:42:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-09 13:42:21,539 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 17 [2024-11-09 13:42:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:42:21,540 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-09 13:42:21,540 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-09 13:42:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-09 13:42:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 13:42:21,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:42:21,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:42:21,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 13:42:21,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:42:21,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:42:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1868440622, now seen corresponding path program 1 times [2024-11-09 13:42:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:42:21,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962177124] [2024-11-09 13:42:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:42:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:42:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:42:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 13:42:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:42:21,638 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-09 13:42:21,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 13:42:21,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962177124] [2024-11-09 13:42:21,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962177124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:42:21,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:42:21,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:42:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316898463] [2024-11-09 13:42:21,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:42:21,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:42:21,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 13:42:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:42:21,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:42:21,645 INFO L87 Difference]: Start difference. First operand 40 states and 53 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-09 13:42:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:42:21,659 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2024-11-09 13:42:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:42:21,660 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-09 13:42:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:42:21,660 INFO L225 Difference]: With dead ends: 40 [2024-11-09 13:42:21,660 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 13:42:21,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:42:21,662 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 54 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-09 13:42:21,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 54 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 13:42:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 13:42:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-09 13:42:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.4375) internal successors, (46), 32 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-09 13:42:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-09 13:42:21,672 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 17 [2024-11-09 13:42:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:42:21,672 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-09 13:42:21,672 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-09 13:42:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-09 13:42:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 13:42:21,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:42:21,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:42:21,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 13:42:21,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:42:21,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:42:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash -239808910, now seen corresponding path program 1 times [2024-11-09 13:42:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 13:42:21,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173924490] [2024-11-09 13:42:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:42:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 13:42:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:42:21,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:42:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:42:21,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 13:42:21,752 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:42:21,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:42:21,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:42:21,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 13:42:21,760 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 13:42:21,788 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:42:21,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:42:21 BoogieIcfgContainer [2024-11-09 13:42:21,794 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:42:21,795 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:42:21,795 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:42:21,795 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:42:21,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:42:20" (3/4) ... [2024-11-09 13:42:21,799 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:42:21,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:42:21,801 INFO L158 Benchmark]: Toolchain (without parser) took 3005.88ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 104.7MB in the beginning and 94.5MB in the end (delta: 10.1MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2024-11-09 13:42:21,802 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 134.2MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:42:21,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1072.33ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 104.5MB in the beginning and 95.0MB in the end (delta: 9.5MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-11-09 13:42:21,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.19ms. Allocated memory is still 188.7MB. Free memory was 95.0MB in the beginning and 91.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:42:21,804 INFO L158 Benchmark]: Boogie Preprocessor took 40.34ms. Allocated memory is still 188.7MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:42:21,804 INFO L158 Benchmark]: RCFGBuilder took 433.86ms. Allocated memory is still 188.7MB. Free memory was 89.7MB in the beginning and 72.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 13:42:21,805 INFO L158 Benchmark]: TraceAbstraction took 1387.81ms. Allocated memory is still 188.7MB. Free memory was 71.9MB in the beginning and 94.5MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:42:21,805 INFO L158 Benchmark]: Witness Printer took 5.39ms. Allocated memory is still 188.7MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:42:21,810 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.24ms. Allocated memory is still 134.2MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1072.33ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 104.5MB in the beginning and 95.0MB in the end (delta: 9.5MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.19ms. Allocated memory is still 188.7MB. Free memory was 95.0MB in the beginning and 91.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.34ms. Allocated memory is still 188.7MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 433.86ms. Allocated memory is still 188.7MB. Free memory was 89.7MB in the beginning and 72.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1387.81ms. Allocated memory is still 188.7MB. Free memory was 71.9MB in the beginning and 94.5MB in the end (delta: -22.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.39ms. Allocated memory is still 188.7MB. Free memory is still 94.5MB. 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: 1559]: 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 1568. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] 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] [L1569] CALL CWE190_Integer_Overflow__int_rand_preinc_10_bad() [L1550] int data; [L1551] 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] [L1552] COND TRUE \read(globalTrue) [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] 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] [L1554] 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] [L1554] 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] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] COND TRUE \read(globalTrue) 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] [L1559] ++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] - UnprovableResult [Line: 1559]: 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.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 140 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 12, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 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-09 13:42:21,840 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_10_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 30377fc63eb9776a40bd65ec000b18c9cb00e137b1dba2618a63567142b1b886 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 13:42:24,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 13:42:24,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-09 13:42:24,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 13:42:24,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 13:42:24,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-09 13:42:24,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 13:42:24,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 13:42:24,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 13:42:24,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 13:42:24,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 13:42:24,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 13:42:24,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 13:42:24,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 13:42:24,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 13:42:24,283 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 13:42:24,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 13:42:24,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 13:42:24,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 13:42:24,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 13:42:24,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 13:42:24,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 13:42:24,287 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 13:42:24,288 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 13:42:24,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 13:42:24,288 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 13:42:24,289 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 13:42:24,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 13:42:24,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 13:42:24,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 13:42:24,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 13:42:24,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 13:42:24,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 13:42:24,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 13:42:24,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:42:24,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 13:42:24,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 13:42:24,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 13:42:24,297 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 13:42:24,298 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 13:42:24,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 13:42:24,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 13:42:24,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 13:42:24,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 13:42:24,300 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 -> 30377fc63eb9776a40bd65ec000b18c9cb00e137b1dba2618a63567142b1b886 [2024-11-09 13:42:24,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 13:42:24,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 13:42:24,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 13:42:24,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 13:42:24,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 13:42:24,634 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_10_bad.i [2024-11-09 13:42:26,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 13:42:26,651 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 13:42:26,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_10_bad.i [2024-11-09 13:42:26,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ac48789/07dcdf396c1f4ddea32c7e8fa27afdab/FLAGa2d102726 [2024-11-09 13:42:26,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ac48789/07dcdf396c1f4ddea32c7e8fa27afdab [2024-11-09 13:42:26,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 13:42:26,705 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 13:42:26,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 13:42:26,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 13:42:26,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 13:42:26,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:42:26" (1/1) ... [2024-11-09 13:42:26,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@953eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:26, skipping insertion in model container [2024-11-09 13:42:26,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:42:26" (1/1) ... [2024-11-09 13:42:26,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 13:42:27,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:42:27,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 13:42:27,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 13:42:27,675 INFO L204 MainTranslator]: Completed translation [2024-11-09 13:42:27,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27 WrapperNode [2024-11-09 13:42:27,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 13:42:27,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 13:42:27,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 13:42:27,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 13:42:27,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,748 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-09 13:42:27,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 13:42:27,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 13:42:27,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 13:42:27,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 13:42:27,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,786 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-09 13:42:27,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 13:42:27,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 13:42:27,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 13:42:27,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 13:42:27,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (1/1) ... [2024-11-09 13:42:27,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 13:42:27,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 13:42:27,853 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-09 13:42:27,856 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-09 13:42:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-09 13:42:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-09 13:42:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 13:42:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 13:42:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 13:42:28,090 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 13:42:28,093 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 13:42:28,268 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-09 13:42:28,269 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 13:42:28,283 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 13:42:28,283 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 13:42:28,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:42:28 BoogieIcfgContainer [2024-11-09 13:42:28,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 13:42:28,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 13:42:28,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 13:42:28,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 13:42:28,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:42:26" (1/3) ... [2024-11-09 13:42:28,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b00d266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:42:28, skipping insertion in model container [2024-11-09 13:42:28,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:42:27" (2/3) ... [2024-11-09 13:42:28,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b00d266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:42:28, skipping insertion in model container [2024-11-09 13:42:28,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:42:28" (3/3) ... [2024-11-09 13:42:28,298 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_10_bad.i [2024-11-09 13:42:28,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 13:42:28,317 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 13:42:28,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 13:42:28,383 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;@a9684b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 13:42:28,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 13:42:28,387 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-09 13:42:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 13:42:28,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:42:28,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:42:28,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:42:28,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:42:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1654475935, now seen corresponding path program 1 times [2024-11-09 13:42:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:42:28,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463026062] [2024-11-09 13:42:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:42:28,414 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-09 13:42:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:42:28,418 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-09 13:42:28,419 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-09 13:42:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:42:28,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 13:42:28,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:42:28,561 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-09 13:42:28,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:42:28,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:42:28,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463026062] [2024-11-09 13:42:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463026062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:42:28,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:42:28,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 13:42:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291739373] [2024-11-09 13:42:28,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:42:28,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 13:42:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:42:28,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 13:42:28,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 13:42:28,597 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-09 13:42:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:42:28,614 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-11-09 13:42:28,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 13:42:28,616 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-09 13:42:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:42:28,622 INFO L225 Difference]: With dead ends: 23 [2024-11-09 13:42:28,623 INFO L226 Difference]: Without dead ends: 15 [2024-11-09 13:42:28,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 13:42:28,631 INFO L432 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-09 13:42:28,633 INFO L433 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-09 13:42:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-09 13:42:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-09 13:42:28,675 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-09 13:42:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-09 13:42:28,679 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-11-09 13:42:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:42:28,680 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-09 13:42:28,680 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-09 13:42:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-09 13:42:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 13:42:28,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:42:28,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:42:28,688 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-09 13:42:28,884 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-09 13:42:28,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:42:28,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:42:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash -250853505, now seen corresponding path program 1 times [2024-11-09 13:42:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:42:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922566987] [2024-11-09 13:42:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:42:28,887 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-09 13:42:28,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:42:28,891 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-09 13:42:28,892 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-09 13:42:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 13:42:29,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 13:42:29,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 13:42:29,060 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-09 13:42:29,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 13:42:29,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 13:42:29,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922566987] [2024-11-09 13:42:29,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922566987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 13:42:29,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 13:42:29,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 13:42:29,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052664806] [2024-11-09 13:42:29,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 13:42:29,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 13:42:29,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 13:42:29,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 13:42:29,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 13:42:29,064 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-09 13:42:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 13:42:29,074 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-11-09 13:42:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 13:42:29,075 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-09 13:42:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 13:42:29,076 INFO L225 Difference]: With dead ends: 19 [2024-11-09 13:42:29,076 INFO L226 Difference]: Without dead ends: 15 [2024-11-09 13:42:29,076 INFO L431 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-09 13:42:29,077 INFO L432 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-09 13:42:29,078 INFO L433 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-09 13:42:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-09 13:42:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-09 13:42:29,084 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-09 13:42:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-09 13:42:29,086 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2024-11-09 13:42:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 13:42:29,086 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-09 13:42:29,087 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-09 13:42:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-09 13:42:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 13:42:29,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 13:42:29,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 13:42:29,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 13:42:29,290 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-09 13:42:29,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-09 13:42:29,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 13:42:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash -819187548, now seen corresponding path program 1 times [2024-11-09 13:42:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 13:42:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603478112] [2024-11-09 13:42:29,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 13:42:29,292 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-09 13:42:29,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 13:42:29,296 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-09 13:42:29,297 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-09 13:42:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:42:29,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 13:42:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 13:42:29,422 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 13:42:29,422 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 13:42:29,423 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-09 13:42:29,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-09 13:42:29,432 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-09 13:42:29,630 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-09 13:42:29,634 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 13:42:29,685 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 13:42:29,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:42:29 BoogieIcfgContainer [2024-11-09 13:42:29,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 13:42:29,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 13:42:29,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 13:42:29,696 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 13:42:29,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:42:28" (3/4) ... [2024-11-09 13:42:29,704 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 13:42:29,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 13:42:29,706 INFO L158 Benchmark]: Toolchain (without parser) took 3000.18ms. Allocated memory was 56.6MB in the beginning and 96.5MB in the end (delta: 39.8MB). Free memory was 30.2MB in the beginning and 65.2MB in the end (delta: -35.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-09 13:42:29,706 INFO L158 Benchmark]: CDTParser took 1.13ms. Allocated memory is still 46.1MB. Free memory was 21.0MB in the beginning and 20.9MB in the end (delta: 60.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:42:29,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 969.66ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 30.0MB in the beginning and 45.6MB in the end (delta: -15.6MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-11-09 13:42:29,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.38ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 42.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:42:29,707 INFO L158 Benchmark]: Boogie Preprocessor took 66.65ms. Allocated memory is still 75.5MB. Free memory was 42.3MB in the beginning and 39.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 13:42:29,729 INFO L158 Benchmark]: RCFGBuilder took 466.87ms. Allocated memory is still 75.5MB. Free memory was 39.8MB in the beginning and 44.7MB in the end (delta: -5.0MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-09 13:42:29,735 INFO L158 Benchmark]: TraceAbstraction took 1406.47ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 43.9MB in the beginning and 65.8MB in the end (delta: -21.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-11-09 13:42:29,735 INFO L158 Benchmark]: Witness Printer took 12.13ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 65.2MB in the end (delta: 538.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 13:42:29,737 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.13ms. Allocated memory is still 46.1MB. Free memory was 21.0MB in the beginning and 20.9MB in the end (delta: 60.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 969.66ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 30.0MB in the beginning and 45.6MB in the end (delta: -15.6MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.38ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 42.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.65ms. Allocated memory is still 75.5MB. Free memory was 42.3MB in the beginning and 39.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 466.87ms. Allocated memory is still 75.5MB. Free memory was 39.8MB in the beginning and 44.7MB in the end (delta: -5.0MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1406.47ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 43.9MB in the beginning and 65.8MB in the end (delta: -21.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Witness Printer took 12.13ms. Allocated memory is still 96.5MB. Free memory was 65.8MB in the beginning and 65.2MB in the end (delta: 538.3kB). 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: 1559]: 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 1568. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1568] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1568] 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] [L1569] CALL CWE190_Integer_Overflow__int_rand_preinc_10_bad() [L1550] int data; [L1551] 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] [L1552] COND TRUE \read(globalTrue) [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] 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] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1556] COND TRUE \read(globalTrue) 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] [L1559] ++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] - UnprovableResult [Line: 1559]: 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.3s, 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, 75 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-09 13:42:29,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample