./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_16_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_16_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 dca09f5eab806f29bda4750c28d5244bbcefc09d71feee8b18c80a4f7f15f8db --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 20:32:32,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 20:32:32,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-20 20:32:32,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 20:32:32,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 20:32:32,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 20:32:32,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 20:32:32,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 20:32:32,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 20:32:32,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 20:32:32,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 20:32:32,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 20:32:32,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 20:32:32,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 20:32:32,905 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 20:32:32,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 20:32:32,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 20:32:32,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 20:32:32,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 20:32:32,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 20:32:32,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 20:32:32,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 20:32:32,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 20:32:32,910 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 20:32:32,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 20:32:32,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 20:32:32,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 20:32:32,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 20:32:32,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 20:32:32,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 20:32:32,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 20:32:32,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:32:32,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 20:32:32,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 20:32:32,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 20:32:32,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 20:32:32,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 20:32:32,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 20:32:32,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 20:32:32,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 20:32:32,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 20:32:32,913 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 -> dca09f5eab806f29bda4750c28d5244bbcefc09d71feee8b18c80a4f7f15f8db [2024-11-20 20:32:33,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 20:32:33,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 20:32:33,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 20:32:33,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 20:32:33,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 20:32:33,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_16_bad.i [2024-11-20 20:32:34,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 20:32:34,562 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 20:32:34,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_16_bad.i [2024-11-20 20:32:34,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966a73e39/7a797960571e408a9f6cb2626ac1fb00/FLAG9212dde87 [2024-11-20 20:32:34,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966a73e39/7a797960571e408a9f6cb2626ac1fb00 [2024-11-20 20:32:34,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 20:32:34,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 20:32:34,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 20:32:34,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 20:32:34,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 20:32:34,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:32:34" (1/1) ... [2024-11-20 20:32:34,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a09b128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:34, skipping insertion in model container [2024-11-20 20:32:34,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:32:34" (1/1) ... [2024-11-20 20:32:34,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 20:32:35,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:32:35,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 20:32:35,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:32:35,672 INFO L204 MainTranslator]: Completed translation [2024-11-20 20:32:35,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35 WrapperNode [2024-11-20 20:32:35,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 20:32:35,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 20:32:35,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 20:32:35,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 20:32:35,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,729 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2024-11-20 20:32:35,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 20:32:35,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 20:32:35,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 20:32:35,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 20:32:35,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,757 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 20:32:35,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 20:32:35,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 20:32:35,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 20:32:35,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 20:32:35,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (1/1) ... [2024-11-20 20:32:35,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:32:35,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 20:32:35,793 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-20 20:32:35,795 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-20 20:32:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 20:32:35,827 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 20:32:35,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 20:32:35,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 20:32:35,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 20:32:35,937 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 20:32:35,938 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 20:32:36,104 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-20 20:32:36,105 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 20:32:36,117 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 20:32:36,117 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 20:32:36,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:36 BoogieIcfgContainer [2024-11-20 20:32:36,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 20:32:36,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 20:32:36,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 20:32:36,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 20:32:36,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:32:34" (1/3) ... [2024-11-20 20:32:36,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336c089f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:32:36, skipping insertion in model container [2024-11-20 20:32:36,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:35" (2/3) ... [2024-11-20 20:32:36,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336c089f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:32:36, skipping insertion in model container [2024-11-20 20:32:36,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:36" (3/3) ... [2024-11-20 20:32:36,126 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_16_bad.i [2024-11-20 20:32:36,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 20:32:36,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 20:32:36,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 20:32:36,192 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;@75d62a9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 20:32:36,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 20:32:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 39 states have internal predecessors, (57), 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-20 20:32:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 20:32:36,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:36,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:36,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:36,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:36,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2036260960, now seen corresponding path program 1 times [2024-11-20 20:32:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:32:36,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804362112] [2024-11-20 20:32:36,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:32:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:32:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,389 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-20 20:32:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:32:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804362112] [2024-11-20 20:32:36,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804362112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:32:36,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:32:36,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 20:32:36,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372126297] [2024-11-20 20:32:36,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:32:36,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 20:32:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:32:36,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 20:32:36,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 20:32:36,422 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 39 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:32:36,436 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2024-11-20 20:32:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 20:32:36,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-20 20:32:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:32:36,444 INFO L225 Difference]: With dead ends: 59 [2024-11-20 20:32:36,444 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 20:32:36,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-20 20:32:36,450 INFO L432 NwaCegarLoop]: 57 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, 57 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-20 20:32:36,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:32:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 20:32:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 20:32:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-20 20:32:36,481 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 11 [2024-11-20 20:32:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:32:36,481 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-20 20:32:36,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-20 20:32:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 20:32:36,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:36,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:36,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 20:32:36,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:36,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:36,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1507885392, now seen corresponding path program 1 times [2024-11-20 20:32:36,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:32:36,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128137820] [2024-11-20 20:32:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:36,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:32:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:32:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,760 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-20 20:32:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:32:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128137820] [2024-11-20 20:32:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128137820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:32:36,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:32:36,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 20:32:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234394478] [2024-11-20 20:32:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:32:36,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 20:32:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:32:36,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 20:32:36,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 20:32:36,765 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:32:36,843 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-20 20:32:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 20:32:36,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-20 20:32:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:32:36,845 INFO L225 Difference]: With dead ends: 42 [2024-11-20 20:32:36,846 INFO L226 Difference]: Without dead ends: 41 [2024-11-20 20:32:36,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 20:32:36,848 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:32:36,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 159 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:32:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-20 20:32:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-20 20:32:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-20 20:32:36,856 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 17 [2024-11-20 20:32:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:32:36,856 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-20 20:32:36,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-20 20:32:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 20:32:36,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:36,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:36,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 20:32:36,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:36,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:36,858 INFO L85 PathProgramCache]: Analyzing trace with hash -495263510, now seen corresponding path program 1 times [2024-11-20 20:32:36,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:32:36,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115195195] [2024-11-20 20:32:36,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:36,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:32:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:32:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,941 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-20 20:32:36,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:32:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115195195] [2024-11-20 20:32:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115195195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:32:36,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:32:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 20:32:36,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286344736] [2024-11-20 20:32:36,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:32:36,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 20:32:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:32:36,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 20:32:36,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:32:36,944 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:32:36,953 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2024-11-20 20:32:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 20:32:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-20 20:32:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:32:36,954 INFO L225 Difference]: With dead ends: 40 [2024-11-20 20:32:36,955 INFO L226 Difference]: Without dead ends: 39 [2024-11-20 20:32:36,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:32:36,956 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:32:36,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 54 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:32:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-20 20:32:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-20 20:32:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.4375) internal successors, (46), 32 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-20 20:32:36,964 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 17 [2024-11-20 20:32:36,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:32:36,964 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-20 20:32:36,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-20 20:32:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 20:32:36,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:36,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:36,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 20:32:36,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:36,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash -500192959, now seen corresponding path program 1 times [2024-11-20 20:32:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:32:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468735111] [2024-11-20 20:32:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:32:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:32:36,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 20:32:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:32:37,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 20:32:37,015 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 20:32:37,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 20:32:37,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 20:32:37,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 20:32:37,019 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 20:32:37,036 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 20:32:37,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:32:37 BoogieIcfgContainer [2024-11-20 20:32:37,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 20:32:37,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 20:32:37,039 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 20:32:37,039 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 20:32:37,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:36" (3/4) ... [2024-11-20 20:32:37,042 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 20:32:37,043 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 20:32:37,043 INFO L158 Benchmark]: Toolchain (without parser) took 2144.76ms. Allocated memory is still 144.7MB. Free memory was 102.3MB in the beginning and 70.1MB in the end (delta: 32.3MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-20 20:32:37,043 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 109.1MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:37,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 773.86ms. Allocated memory is still 144.7MB. Free memory was 101.7MB in the beginning and 110.7MB in the end (delta: -9.0MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-11-20 20:32:37,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.13ms. Allocated memory is still 144.7MB. Free memory was 110.0MB in the beginning and 107.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:32:37,046 INFO L158 Benchmark]: Boogie Preprocessor took 37.86ms. Allocated memory is still 144.7MB. Free memory was 107.2MB in the beginning and 105.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:32:37,046 INFO L158 Benchmark]: RCFGBuilder took 348.77ms. Allocated memory is still 144.7MB. Free memory was 105.1MB in the beginning and 88.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 20:32:37,046 INFO L158 Benchmark]: TraceAbstraction took 918.80ms. Allocated memory is still 144.7MB. Free memory was 87.7MB in the beginning and 70.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-20 20:32:37,046 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 144.7MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:37,047 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.08ms. Allocated memory is still 109.1MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 773.86ms. Allocated memory is still 144.7MB. Free memory was 101.7MB in the beginning and 110.7MB in the end (delta: -9.0MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.13ms. Allocated memory is still 144.7MB. Free memory was 110.0MB in the beginning and 107.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.86ms. Allocated memory is still 144.7MB. Free memory was 107.2MB in the beginning and 105.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.77ms. Allocated memory is still 144.7MB. Free memory was 105.1MB in the beginning and 88.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 918.80ms. Allocated memory is still 144.7MB. Free memory was 87.7MB in the beginning and 70.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 144.7MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1570. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1570] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] CALL CWE190_Integer_Overflow__int_rand_preinc_16_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1557] COND TRUE 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 142 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 74 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 20:32:37,066 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_16_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 dca09f5eab806f29bda4750c28d5244bbcefc09d71feee8b18c80a4f7f15f8db --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 20:32:38,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 20:32:38,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-20 20:32:38,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 20:32:38,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 20:32:38,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-20 20:32:38,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 20:32:38,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 20:32:38,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 20:32:38,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 20:32:38,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 20:32:38,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 20:32:38,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 20:32:38,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 20:32:38,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 20:32:38,873 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 20:32:38,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 20:32:38,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 20:32:38,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 20:32:38,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 20:32:38,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 20:32:38,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 20:32:38,875 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 20:32:38,875 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 20:32:38,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 20:32:38,875 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 20:32:38,875 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 20:32:38,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 20:32:38,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 20:32:38,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 20:32:38,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 20:32:38,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 20:32:38,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 20:32:38,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 20:32:38,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:32:38,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 20:32:38,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 20:32:38,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 20:32:38,878 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 20:32:38,878 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 20:32:38,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 20:32:38,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 20:32:38,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 20:32:38,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 20:32:38,879 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 -> dca09f5eab806f29bda4750c28d5244bbcefc09d71feee8b18c80a4f7f15f8db [2024-11-20 20:32:39,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 20:32:39,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 20:32:39,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 20:32:39,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 20:32:39,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 20:32:39,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_16_bad.i [2024-11-20 20:32:40,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 20:32:40,611 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 20:32:40,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_16_bad.i [2024-11-20 20:32:40,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3389703ae/28fbb37e34864f369b48a518f14c1560/FLAG031b10b5a [2024-11-20 20:32:40,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3389703ae/28fbb37e34864f369b48a518f14c1560 [2024-11-20 20:32:40,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 20:32:40,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 20:32:40,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 20:32:40,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 20:32:40,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 20:32:40,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:32:40" (1/1) ... [2024-11-20 20:32:40,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ca83f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:40, skipping insertion in model container [2024-11-20 20:32:40,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:32:40" (1/1) ... [2024-11-20 20:32:40,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 20:32:41,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:32:41,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 20:32:41,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:32:41,407 INFO L204 MainTranslator]: Completed translation [2024-11-20 20:32:41,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41 WrapperNode [2024-11-20 20:32:41,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 20:32:41,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 20:32:41,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 20:32:41,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 20:32:41,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,463 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-11-20 20:32:41,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 20:32:41,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 20:32:41,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 20:32:41,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 20:32:41,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,490 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 20:32:41,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 20:32:41,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 20:32:41,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 20:32:41,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 20:32:41,512 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:32:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 20:32:41,538 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-20 20:32:41,540 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-20 20:32:41,572 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 20:32:41,573 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 20:32:41,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 20:32:41,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 20:32:41,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 20:32:41,715 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 20:32:41,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 20:32:41,824 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-20 20:32:41,824 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 20:32:41,837 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 20:32:41,837 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 20:32:41,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:41 BoogieIcfgContainer [2024-11-20 20:32:41,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 20:32:41,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 20:32:41,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 20:32:41,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 20:32:41,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:32:40" (1/3) ... [2024-11-20 20:32:41,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da29a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:32:41, skipping insertion in model container [2024-11-20 20:32:41,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41" (2/3) ... [2024-11-20 20:32:41,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da29a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:32:41, skipping insertion in model container [2024-11-20 20:32:41,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:41" (3/3) ... [2024-11-20 20:32:41,846 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_16_bad.i [2024-11-20 20:32:41,859 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 20:32:41,859 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 20:32:41,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 20:32:41,913 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;@446d59cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 20:32:41,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 20:32:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 19 states have internal predecessors, (25), 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-20 20:32:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 20:32:41,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:41,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:41,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:41,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1037499696, now seen corresponding path program 1 times [2024-11-20 20:32:41,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:32:41,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273732004] [2024-11-20 20:32:41,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:41,940 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-20 20:32:41,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:32:41,943 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-20 20:32:41,944 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-20 20:32:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:42,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 20:32:42,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 20:32:42,068 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-20 20:32:42,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 20:32:42,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 20:32:42,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273732004] [2024-11-20 20:32:42,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273732004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:32:42,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:32:42,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 20:32:42,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26472182] [2024-11-20 20:32:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:32:42,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 20:32:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 20:32:42,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 20:32:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 20:32:42,095 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:32:42,109 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-11-20 20:32:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 20:32:42,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-20 20:32:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:32:42,116 INFO L225 Difference]: With dead ends: 38 [2024-11-20 20:32:42,116 INFO L226 Difference]: Without dead ends: 15 [2024-11-20 20:32:42,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 20:32:42,121 INFO L432 NwaCegarLoop]: 24 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, 24 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-20 20:32:42,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:32:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-20 20:32:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-20 20:32:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-20 20:32:42,150 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2024-11-20 20:32:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:32:42,151 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-20 20:32:42,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-20 20:32:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 20:32:42,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:42,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:42,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 20:32:42,352 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-20 20:32:42,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:42,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1525694733, now seen corresponding path program 1 times [2024-11-20 20:32:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:32:42,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174994255] [2024-11-20 20:32:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:42,354 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-20 20:32:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:32:42,357 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-20 20:32:42,358 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-20 20:32:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:32:42,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 20:32:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:32:42,476 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 20:32:42,476 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 20:32:42,478 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 20:32:42,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 20:32:42,484 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-20 20:32:42,682 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-20 20:32:42,685 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-20 20:32:42,700 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 20:32:42,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:32:42 BoogieIcfgContainer [2024-11-20 20:32:42,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 20:32:42,708 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 20:32:42,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 20:32:42,708 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 20:32:42,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:41" (3/4) ... [2024-11-20 20:32:42,710 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 20:32:42,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 20:32:42,712 INFO L158 Benchmark]: Toolchain (without parser) took 2046.17ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 64.8MB in the beginning and 74.0MB in the end (delta: -9.1MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-20 20:32:42,712 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 58.7MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:42,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.10ms. Allocated memory is still 86.0MB. Free memory was 64.8MB in the beginning and 56.6MB in the end (delta: 8.2MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2024-11-20 20:32:42,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.65ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 53.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:32:42,713 INFO L158 Benchmark]: Boogie Preprocessor took 42.12ms. Allocated memory is still 86.0MB. Free memory was 53.4MB in the beginning and 50.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 20:32:42,713 INFO L158 Benchmark]: RCFGBuilder took 326.49ms. Allocated memory is still 86.0MB. Free memory was 50.9MB in the beginning and 36.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 20:32:42,713 INFO L158 Benchmark]: TraceAbstraction took 866.95ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 36.2MB in the beginning and 74.6MB in the end (delta: -38.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:42,714 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 121.6MB. Free memory was 74.6MB in the beginning and 74.0MB in the end (delta: 615.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:42,715 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.09ms. Allocated memory is still 58.7MB. Free memory was 28.9MB in the beginning and 28.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.10ms. Allocated memory is still 86.0MB. Free memory was 64.8MB in the beginning and 56.6MB in the end (delta: 8.2MB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.65ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 53.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.12ms. Allocated memory is still 86.0MB. Free memory was 53.4MB in the beginning and 50.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 326.49ms. Allocated memory is still 86.0MB. Free memory was 50.9MB in the beginning and 36.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 866.95ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 36.2MB in the beginning and 74.6MB in the end (delta: -38.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 121.6MB. Free memory was 74.6MB in the beginning and 74.0MB in the end (delta: 615.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1570. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1570] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1571] CALL CWE190_Integer_Overflow__int_rand_preinc_16_bad() [L1550] int data; [L1551] data = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1557] COND TRUE 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 24 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 37 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-20 20:32:42,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample