./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_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 a3201307307e47fa08ad351bb3671e2a16c2d02ed34e995988ac10cf26b5ec0f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:41:26,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:41:26,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 18:41:26,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:41:26,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:41:26,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:41:26,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:41:26,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:41:26,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:41:26,349 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:41:26,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:41:26,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:41:26,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:41:26,351 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:41:26,351 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:41:26,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:41:26,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:41:26,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 18:41:26,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:41:26,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:41:26,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:41:26,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:41:26,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:41:26,354 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:41:26,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:41:26,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:41:26,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:41:26,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:41:26,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:41:26,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:41:26,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:41:26,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:41:26,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:41:26,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:41:26,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:41:26,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 18:41:26,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 18:41:26,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:41:26,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:41:26,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:41:26,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:41:26,359 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 -> a3201307307e47fa08ad351bb3671e2a16c2d02ed34e995988ac10cf26b5ec0f [2024-11-12 18:41:26,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:41:26,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:41:26,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:41:26,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:41:26,670 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:41:26,671 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_fgets_preinc_15_bad.i [2024-11-12 18:41:28,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:41:28,404 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:41:28,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-12 18:41:28,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d947540f/b611be25c7a046b6a04cb9520e284d50/FLAGed0ec61e5 [2024-11-12 18:41:28,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d947540f/b611be25c7a046b6a04cb9520e284d50 [2024-11-12 18:41:28,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:41:28,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:41:28,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:41:28,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:41:28,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:41:28,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:41:28" (1/1) ... [2024-11-12 18:41:28,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3618d89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:28, skipping insertion in model container [2024-11-12 18:41:28,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:41:28" (1/1) ... [2024-11-12 18:41:28,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:41:29,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:41:29,366 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:41:29,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:41:29,578 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:41:29,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29 WrapperNode [2024-11-12 18:41:29,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:41:29,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:41:29,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:41:29,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:41:29,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,634 INFO L138 Inliner]: procedures = 498, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-12 18:41:29,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:41:29,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:41:29,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:41:29,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:41:29,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,673 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-12 18:41:29,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:41:29,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:41:29,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:41:29,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:41:29,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (1/1) ... [2024-11-12 18:41:29,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:41:29,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:41:29,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 18:41:29,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 18:41:29,785 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:41:29,785 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:41:29,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:41:29,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:41:29,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:41:29,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 18:41:29,950 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:41:29,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:41:30,111 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-12 18:41:30,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:41:30,128 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:41:30,128 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 18:41:30,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:41:30 BoogieIcfgContainer [2024-11-12 18:41:30,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:41:30,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:41:30,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:41:30,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:41:30,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:41:28" (1/3) ... [2024-11-12 18:41:30,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6826ef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:41:30, skipping insertion in model container [2024-11-12 18:41:30,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:29" (2/3) ... [2024-11-12 18:41:30,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6826ef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:41:30, skipping insertion in model container [2024-11-12 18:41:30,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:41:30" (3/3) ... [2024-11-12 18:41:30,140 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-12 18:41:30,159 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:41:30,159 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 18:41:30,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:41:30,241 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;@2477664a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:41:30,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 18:41:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 18:41:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 18:41:30,255 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:41:30,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:41:30,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:41:30,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:41:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1760262427, now seen corresponding path program 1 times [2024-11-12 18:41:30,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:41:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015476073] [2024-11-12 18:41:30,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:41:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:41:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:41:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:41:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:41:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:41:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:41:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015476073] [2024-11-12 18:41:30,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015476073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:41:30,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:41:30,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 18:41:30,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206383048] [2024-11-12 18:41:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:41:30,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:41:30,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:41:30,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:41:30,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:41:30,622 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:41:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:41:30,660 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-11-12 18:41:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:41:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-12 18:41:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:41:30,669 INFO L225 Difference]: With dead ends: 51 [2024-11-12 18:41:30,670 INFO L226 Difference]: Without dead ends: 19 [2024-11-12 18:41:30,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:41:30,676 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:41:30,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:41:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-12 18:41:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-12 18:41:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 18:41:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-12 18:41:30,708 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2024-11-12 18:41:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:41:30,710 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-12 18:41:30,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:41:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-12 18:41:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 18:41:30,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:41:30,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:41:30,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 18:41:30,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:41:30,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:41:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash 938288870, now seen corresponding path program 1 times [2024-11-12 18:41:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:41:30,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849218057] [2024-11-12 18:41:30,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:41:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:41:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:41:30,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 18:41:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:41:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:41:30,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 18:41:30,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849218057] [2024-11-12 18:41:30,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849218057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:41:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:41:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 18:41:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61145890] [2024-11-12 18:41:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:41:30,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:41:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 18:41:30,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:41:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:41:30,880 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:41:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:41:30,896 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-12 18:41:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:41:30,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-12 18:41:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:41:30,897 INFO L225 Difference]: With dead ends: 19 [2024-11-12 18:41:30,897 INFO L226 Difference]: Without dead ends: 18 [2024-11-12 18:41:30,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:41:30,899 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:41:30,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 27 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:41:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-12 18:41:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-12 18:41:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 18:41:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-12 18:41:30,902 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-12 18:41:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:41:30,903 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-12 18:41:30,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:41:30,903 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-12 18:41:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 18:41:30,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:41:30,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:41:30,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 18:41:30,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:41:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:41:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash -977816031, now seen corresponding path program 1 times [2024-11-12 18:41:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 18:41:30,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638527412] [2024-11-12 18:41:30,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:41:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 18:41:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:41:30,954 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:41:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:41:30,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 18:41:30,998 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:41:30,999 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 18:41:31,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 18:41:31,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 18:41:31,007 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 18:41:31,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:41:31,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:41:31 BoogieIcfgContainer [2024-11-12 18:41:31,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:41:31,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:41:31,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:41:31,044 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:41:31,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:41:30" (3/4) ... [2024-11-12 18:41:31,047 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:41:31,047 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:41:31,048 INFO L158 Benchmark]: Toolchain (without parser) took 2594.11ms. Allocated memory is still 199.2MB. Free memory was 128.1MB in the beginning and 160.4MB in the end (delta: -32.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:41:31,049 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:41:31,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1123.84ms. Allocated memory is still 199.2MB. Free memory was 127.9MB in the beginning and 121.4MB in the end (delta: 6.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-12 18:41:31,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.88ms. Allocated memory is still 199.2MB. Free memory was 121.4MB in the beginning and 118.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:41:31,050 INFO L158 Benchmark]: Boogie Preprocessor took 54.07ms. Allocated memory is still 199.2MB. Free memory was 118.5MB in the beginning and 116.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:41:31,051 INFO L158 Benchmark]: RCFGBuilder took 440.01ms. Allocated memory is still 199.2MB. Free memory was 116.4MB in the beginning and 101.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 18:41:31,051 INFO L158 Benchmark]: TraceAbstraction took 910.55ms. Allocated memory is still 199.2MB. Free memory was 101.3MB in the beginning and 161.4MB in the end (delta: -60.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:41:31,052 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 199.2MB. Free memory was 161.4MB in the beginning and 160.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:41:31,054 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1123.84ms. Allocated memory is still 199.2MB. Free memory was 127.9MB in the beginning and 121.4MB in the end (delta: 6.5MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.88ms. Allocated memory is still 199.2MB. Free memory was 121.4MB in the beginning and 118.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.07ms. Allocated memory is still 199.2MB. Free memory was 118.5MB in the beginning and 116.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 440.01ms. Allocated memory is still 199.2MB. Free memory was 116.4MB in the beginning and 101.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 910.55ms. Allocated memory is still 199.2MB. Free memory was 101.3MB in the beginning and 161.4MB in the end (delta: -60.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 199.2MB. Free memory was 161.4MB in the beginning and 160.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1588. 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] [L1588] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={5:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1588] 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] [L1589] CALL CWE190_Integer_Overflow__int_fgets_preinc_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; 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] case 6: [L1559] data = atoi(inputBuffer) [L1573] case 7: 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] [L1575] ++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: 1575]: 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, 31 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 52 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 6, 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.3s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 18:41:31,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_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 a3201307307e47fa08ad351bb3671e2a16c2d02ed34e995988ac10cf26b5ec0f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 18:41:33,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 18:41:33,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 18:41:33,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 18:41:33,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 18:41:33,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 18:41:33,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 18:41:33,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 18:41:33,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 18:41:33,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 18:41:33,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 18:41:33,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 18:41:33,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 18:41:33,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 18:41:33,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 18:41:33,525 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 18:41:33,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 18:41:33,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 18:41:33,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 18:41:33,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 18:41:33,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 18:41:33,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 18:41:33,531 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 18:41:33,531 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 18:41:33,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 18:41:33,531 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 18:41:33,532 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 18:41:33,532 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 18:41:33,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 18:41:33,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 18:41:33,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 18:41:33,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 18:41:33,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 18:41:33,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 18:41:33,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:41:33,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 18:41:33,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 18:41:33,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 18:41:33,537 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 18:41:33,537 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 18:41:33,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 18:41:33,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 18:41:33,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 18:41:33,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 18:41:33,538 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 -> a3201307307e47fa08ad351bb3671e2a16c2d02ed34e995988ac10cf26b5ec0f [2024-11-12 18:41:33,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 18:41:33,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 18:41:33,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 18:41:33,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 18:41:33,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 18:41:33,925 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_fgets_preinc_15_bad.i [2024-11-12 18:41:35,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 18:41:35,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 18:41:35,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-12 18:41:35,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960d76f02/626bb3ade02a497db83e2f107ec12ead/FLAG92b571fa3 [2024-11-12 18:41:35,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/960d76f02/626bb3ade02a497db83e2f107ec12ead [2024-11-12 18:41:35,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 18:41:35,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 18:41:35,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 18:41:35,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 18:41:35,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 18:41:35,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:41:35" (1/1) ... [2024-11-12 18:41:35,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3441208a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:35, skipping insertion in model container [2024-11-12 18:41:35,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:41:35" (1/1) ... [2024-11-12 18:41:35,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 18:41:36,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:41:36,814 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 18:41:36,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 18:41:37,050 INFO L204 MainTranslator]: Completed translation [2024-11-12 18:41:37,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37 WrapperNode [2024-11-12 18:41:37,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 18:41:37,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 18:41:37,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 18:41:37,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 18:41:37,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,122 INFO L138 Inliner]: procedures = 503, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2024-11-12 18:41:37,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 18:41:37,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 18:41:37,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 18:41:37,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 18:41:37,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,172 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2024-11-12 18:41:37,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 18:41:37,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 18:41:37,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 18:41:37,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 18:41:37,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (1/1) ... [2024-11-12 18:41:37,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 18:41:37,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 18:41:37,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 18:41:37,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 18:41:37,291 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 18:41:37,292 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 18:41:37,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 18:41:37,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 18:41:37,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 18:41:37,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 18:41:37,481 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 18:41:37,483 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 18:41:37,659 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-12 18:41:37,659 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 18:41:37,680 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 18:41:37,680 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 18:41:37,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:41:37 BoogieIcfgContainer [2024-11-12 18:41:37,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 18:41:37,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 18:41:37,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 18:41:37,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 18:41:37,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:41:35" (1/3) ... [2024-11-12 18:41:37,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d1d0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:41:37, skipping insertion in model container [2024-11-12 18:41:37,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:41:37" (2/3) ... [2024-11-12 18:41:37,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d1d0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:41:37, skipping insertion in model container [2024-11-12 18:41:37,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:41:37" (3/3) ... [2024-11-12 18:41:37,693 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_15_bad.i [2024-11-12 18:41:37,736 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 18:41:37,736 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 18:41:37,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 18:41:37,822 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;@504da6c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 18:41:37,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 18:41:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 18:41:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 18:41:37,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:41:37,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:41:37,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:41:37,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:41:37,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1760262427, now seen corresponding path program 1 times [2024-11-12 18:41:37,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:41:37,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405023185] [2024-11-12 18:41:37,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:41:37,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:41:37,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:41:37,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 18:41:37,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 18:41:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:41:37,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 18:41:37,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:41:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:41:38,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:41:38,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:41:38,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405023185] [2024-11-12 18:41:38,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405023185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:41:38,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:41:38,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 18:41:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008323325] [2024-11-12 18:41:38,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:41:38,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 18:41:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:41:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 18:41:38,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 18:41:38,054 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:41:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:41:38,073 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-12 18:41:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 18:41:38,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2024-11-12 18:41:38,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:41:38,083 INFO L225 Difference]: With dead ends: 31 [2024-11-12 18:41:38,083 INFO L226 Difference]: Without dead ends: 20 [2024-11-12 18:41:38,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 18:41:38,093 INFO L435 NwaCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:41:38,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:41:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-12 18:41:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-12 18:41:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 18:41:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-12 18:41:38,134 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2024-11-12 18:41:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:41:38,135 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-12 18:41:38,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:41:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-12 18:41:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 18:41:38,137 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:41:38,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:41:38,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 18:41:38,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:41:38,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:41:38,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:41:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1266439682, now seen corresponding path program 1 times [2024-11-12 18:41:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:41:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119549734] [2024-11-12 18:41:38,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:41:38,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:41:38,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:41:38,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 18:41:38,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 18:41:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 18:41:38,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 18:41:38,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 18:41:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 18:41:38,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 18:41:38,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 18:41:38,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119549734] [2024-11-12 18:41:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119549734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 18:41:38,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 18:41:38,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 18:41:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934873934] [2024-11-12 18:41:38,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 18:41:38,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 18:41:38,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 18:41:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 18:41:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:41:38,466 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:41:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 18:41:38,482 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-12 18:41:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 18:41:38,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-12 18:41:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 18:41:38,484 INFO L225 Difference]: With dead ends: 29 [2024-11-12 18:41:38,484 INFO L226 Difference]: Without dead ends: 18 [2024-11-12 18:41:38,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 18:41:38,486 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 18:41:38,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 18:41:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-12 18:41:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-12 18:41:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 18:41:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-12 18:41:38,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2024-11-12 18:41:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 18:41:38,493 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-12 18:41:38,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 18:41:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-12 18:41:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 18:41:38,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 18:41:38,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 18:41:38,500 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-12 18:41:38,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:41:38,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 18:41:38,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 18:41:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash -977816031, now seen corresponding path program 1 times [2024-11-12 18:41:38,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 18:41:38,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891333301] [2024-11-12 18:41:38,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 18:41:38,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:41:38,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 18:41:38,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 18:41:38,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 18:41:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:41:38,790 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 18:41:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 18:41:38,853 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 18:41:38,854 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 18:41:38,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 18:41:38,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 18:41:38,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 18:41:39,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 18:41:39,063 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 18:41:39,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 18:41:39,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:41:39 BoogieIcfgContainer [2024-11-12 18:41:39,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 18:41:39,112 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 18:41:39,112 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 18:41:39,113 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 18:41:39,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:41:37" (3/4) ... [2024-11-12 18:41:39,116 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 18:41:39,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 18:41:39,118 INFO L158 Benchmark]: Toolchain (without parser) took 3257.04ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 46.4MB in the beginning and 67.0MB in the end (delta: -20.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:41:39,118 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 58.7MB. Free memory was 37.1MB in the beginning and 37.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:41:39,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1187.54ms. Allocated memory is still 81.8MB. Free memory was 46.3MB in the beginning and 48.7MB in the end (delta: -2.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-12 18:41:39,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.51ms. Allocated memory is still 81.8MB. Free memory was 48.7MB in the beginning and 45.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 18:41:39,119 INFO L158 Benchmark]: Boogie Preprocessor took 76.41ms. Allocated memory is still 81.8MB. Free memory was 45.5MB in the beginning and 42.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 18:41:39,120 INFO L158 Benchmark]: RCFGBuilder took 479.34ms. Allocated memory is still 81.8MB. Free memory was 42.9MB in the beginning and 26.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 18:41:39,120 INFO L158 Benchmark]: TraceAbstraction took 1429.16ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 26.1MB in the beginning and 67.6MB in the end (delta: -41.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-12 18:41:39,121 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 98.6MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 18:41:39,123 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.97ms. Allocated memory is still 58.7MB. Free memory was 37.1MB in the beginning and 37.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1187.54ms. Allocated memory is still 81.8MB. Free memory was 46.3MB in the beginning and 48.7MB in the end (delta: -2.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.51ms. Allocated memory is still 81.8MB. Free memory was 48.7MB in the beginning and 45.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.41ms. Allocated memory is still 81.8MB. Free memory was 45.5MB in the beginning and 42.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.34ms. Allocated memory is still 81.8MB. Free memory was 42.9MB in the beginning and 26.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1429.16ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 26.1MB in the beginning and 67.6MB in the end (delta: -41.4MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 98.6MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of atoi at line 1559, overapproximation of large string literal at line 1588. 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] [L1588] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={5:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1588] 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] [L1589] CALL CWE190_Integer_Overflow__int_fgets_preinc_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: [L1556] char inputBuffer[(3 * sizeof(data) + 2)] = ""; 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] case 6: [L1559] data = atoi(inputBuffer) [L1573] case 7: 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] [L1575] ++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: 1575]: 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, 31 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, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 58 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 18:41:39,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample