./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_15_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_15_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dff7a34f126cebfd70209ee3091c1d26d4a312400d5536a6607b8d06fec542a2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 20:32:31,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 20:32:31,865 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:31,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 20:32:31,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 20:32:31,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 20:32:31,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 20:32:31,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 20:32:31,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 20:32:31,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 20:32:31,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 20:32:31,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 20:32:31,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 20:32:31,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 20:32:31,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 20:32:31,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 20:32:31,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 20:32:31,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 20:32:31,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 20:32:31,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 20:32:31,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 20:32:31,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 20:32:31,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 20:32:31,922 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 20:32:31,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 20:32:31,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 20:32:31,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 20:32:31,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 20:32:31,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 20:32:31,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 20:32:31,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 20:32:31,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:32:31,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 20:32:31,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 20:32:31,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 20:32:31,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 20:32:31,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 20:32:31,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 20:32:31,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 20:32:31,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 20:32:31,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 20:32:31,927 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 -> dff7a34f126cebfd70209ee3091c1d26d4a312400d5536a6607b8d06fec542a2 [2024-11-20 20:32:32,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 20:32:32,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 20:32:32,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 20:32:32,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 20:32:32,228 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 20:32:32,229 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_15_bad.i [2024-11-20 20:32:33,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 20:32:34,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 20:32:34,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-20 20:32:34,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ce0c4c1/fce5063f37c44018af57d724a79eea78/FLAGc4bd0f0f9 [2024-11-20 20:32:34,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ce0c4c1/fce5063f37c44018af57d724a79eea78 [2024-11-20 20:32:34,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 20:32:34,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 20:32:34,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 20:32:34,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 20:32:34,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 20:32:34,095 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,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c6e72c 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,097 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,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 20:32:34,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:32:34,850 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 20:32:34,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:32:35,137 INFO L204 MainTranslator]: Completed translation [2024-11-20 20:32:35,138 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,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 20:32:35,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 20:32:35,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 20:32:35,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 20:32:35,146 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,173 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,210 INFO L138 Inliner]: procedures = 497, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2024-11-20 20:32:35,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 20:32:35,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 20:32:35,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 20:32:35,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 20:32:35,222 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,222 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,225 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,236 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 20:32:35,237 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,237 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,241 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,245 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,247 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,248 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,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 20:32:35,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 20:32:35,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 20:32:35,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 20:32:35,256 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,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:32:35,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 20:32:35,288 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,291 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,333 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 20:32:35,334 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 20:32:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 20:32:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 20:32:35,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 20:32:35,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 20:32:35,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 20:32:35,647 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-20 20:32:35,648 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 20:32:35,663 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 20:32:35,663 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 20:32:35,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:35 BoogieIcfgContainer [2024-11-20 20:32:35,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 20:32:35,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 20:32:35,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 20:32:35,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 20:32:35,671 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:35,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa673db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:32:35, skipping insertion in model container [2024-11-20 20:32:35,672 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:35,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa673db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:32:35, skipping insertion in model container [2024-11-20 20:32:35,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:35" (3/3) ... [2024-11-20 20:32:35,674 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-20 20:32:35,690 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 20:32:35,690 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 20:32:35,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 20:32:35,749 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;@1e4a8272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 20:32:35,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 20:32:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 45 states have internal predecessors, (61), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-20 20:32:35,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 20:32:35,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:35,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:35,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -930289097, now seen corresponding path program 1 times [2024-11-20 20:32:35,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:32:35,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523044527] [2024-11-20 20:32:35,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:35,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:32:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:32:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,027 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,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:32:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523044527] [2024-11-20 20:32:36,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523044527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:32:36,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:32:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 20:32:36,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008458758] [2024-11-20 20:32:36,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:32:36,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 20:32:36,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:32:36,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 20:32:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:32:36,062 INFO L87 Difference]: Start difference. First operand has 49 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 45 states have internal predecessors, (61), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:32:36,089 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-20 20:32:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 20:32:36,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-20 20:32:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:32:36,096 INFO L225 Difference]: With dead ends: 69 [2024-11-20 20:32:36,096 INFO L226 Difference]: Without dead ends: 37 [2024-11-20 20:32:36,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:32:36,102 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:32:36,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:32:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-20 20:32:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-20 20:32:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-20 20:32:36,133 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 13 [2024-11-20 20:32:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:32:36,133 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-20 20:32:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-20 20:32:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 20:32:36,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:36,136 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,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 20:32:36,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:36,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1666609480, now seen corresponding path program 1 times [2024-11-20 20:32:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:32:36,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159983412] [2024-11-20 20:32:36,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:32:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:32:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,467 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,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:32:36,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159983412] [2024-11-20 20:32:36,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159983412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:32:36,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:32:36,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 20:32:36,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379943868] [2024-11-20 20:32:36,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:32:36,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 20:32:36,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:32:36,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 20:32:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 20:32:36,475 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:32:36,571 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-11-20 20:32:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 20:32:36,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2024-11-20 20:32:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:32:36,573 INFO L225 Difference]: With dead ends: 44 [2024-11-20 20:32:36,573 INFO L226 Difference]: Without dead ends: 43 [2024-11-20 20:32:36,574 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,575 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 40 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 20:32:36,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 161 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 20:32:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-20 20:32:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-20 20:32:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 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,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2024-11-20 20:32:36,599 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18 [2024-11-20 20:32:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:32:36,600 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2024-11-20 20:32:36,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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,600 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2024-11-20 20:32:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 20:32:36,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:36,601 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,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 20:32:36,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:36,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash 660283998, now seen corresponding path program 1 times [2024-11-20 20:32:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:32:36,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429149310] [2024-11-20 20:32:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:32:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 20:32:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:36,778 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,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 20:32:36,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429149310] [2024-11-20 20:32:36,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429149310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:32:36,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:32:36,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 20:32:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852969753] [2024-11-20 20:32:36,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:32:36,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 20:32:36,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 20:32:36,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 20:32:36,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:32:36,786 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:32:36,798 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-20 20:32:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 20:32:36,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2024-11-20 20:32:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:32:36,800 INFO L225 Difference]: With dead ends: 42 [2024-11-20 20:32:36,802 INFO L226 Difference]: Without dead ends: 41 [2024-11-20 20:32:36,802 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,803 INFO L432 NwaCegarLoop]: 47 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, 55 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,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 55 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,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-20 20:32:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2024-11-20 20:32:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.4242424242424243) 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,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-20 20:32:36,814 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 18 [2024-11-20 20:32:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:32:36,814 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-20 20:32:36,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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,815 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-20 20:32:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 20:32:36,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:36,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:36,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 20:32:36,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:36,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:36,817 INFO L85 PathProgramCache]: Analyzing trace with hash -125286187, now seen corresponding path program 1 times [2024-11-20 20:32:36,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 20:32:36,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15058841] [2024-11-20 20:32:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 20:32:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:32:36,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 20:32:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:32:36,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 20:32:36,888 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 20:32:36,890 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 20:32:36,894 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 20:32:36,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 20:32:36,897 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 20:32:36,920 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 20:32:36,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:32:36 BoogieIcfgContainer [2024-11-20 20:32:36,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 20:32:36,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 20:32:36,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 20:32:36,924 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 20:32:36,925 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:35" (3/4) ... [2024-11-20 20:32:36,927 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 20:32:36,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 20:32:36,929 INFO L158 Benchmark]: Toolchain (without parser) took 2840.91ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 81.2MB in the beginning and 135.9MB in the end (delta: -54.6MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2024-11-20 20:32:36,929 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 138.4MB. Free memory was 99.6MB in the beginning and 99.5MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:36,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1048.95ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 81.2MB in the beginning and 128.1MB in the end (delta: -46.9MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-20 20:32:36,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.96ms. Allocated memory is still 197.1MB. Free memory was 128.1MB in the beginning and 125.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:32:36,934 INFO L158 Benchmark]: Boogie Preprocessor took 42.47ms. Allocated memory is still 197.1MB. Free memory was 125.1MB in the beginning and 121.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:32:36,934 INFO L158 Benchmark]: RCFGBuilder took 409.32ms. Allocated memory is still 197.1MB. Free memory was 121.9MB in the beginning and 104.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 20:32:36,935 INFO L158 Benchmark]: TraceAbstraction took 1257.26ms. Allocated memory is still 197.1MB. Free memory was 104.1MB in the beginning and 135.9MB in the end (delta: -31.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:36,935 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 197.1MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:36,937 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.18ms. Allocated memory is still 138.4MB. Free memory was 99.6MB in the beginning and 99.5MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1048.95ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 81.2MB in the beginning and 128.1MB in the end (delta: -46.9MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.96ms. Allocated memory is still 197.1MB. Free memory was 128.1MB in the beginning and 125.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.47ms. Allocated memory is still 197.1MB. Free memory was 125.1MB in the beginning and 121.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.32ms. Allocated memory is still 197.1MB. Free memory was 121.9MB in the beginning and 104.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1257.26ms. Allocated memory is still 197.1MB. Free memory was 104.1MB in the beginning and 135.9MB in the end (delta: -31.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 197.1MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1565]: 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 1578. 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] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] 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] [L1579] CALL CWE190_Integer_Overflow__int_rand_preinc_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: [L1554] case 6: [L1554] case 6: [L1555] 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] case 6: [L1555] 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] [L1555] 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] [L1555] data = ((int)(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=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1563] case 7: VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1565] ++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: 1565]: 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, 49 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, 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.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 339 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 189 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 150 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 20:32:36,961 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_15_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dff7a34f126cebfd70209ee3091c1d26d4a312400d5536a6607b8d06fec542a2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 20:32:39,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 20:32:39,294 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:39,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 20:32:39,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 20:32:39,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-20 20:32:39,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 20:32:39,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 20:32:39,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 20:32:39,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 20:32:39,341 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 20:32:39,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 20:32:39,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 20:32:39,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 20:32:39,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 20:32:39,346 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 20:32:39,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 20:32:39,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 20:32:39,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 20:32:39,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 20:32:39,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 20:32:39,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 20:32:39,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 20:32:39,348 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 20:32:39,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 20:32:39,349 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 20:32:39,349 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 20:32:39,349 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 20:32:39,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 20:32:39,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 20:32:39,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 20:32:39,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 20:32:39,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 20:32:39,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 20:32:39,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:32:39,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 20:32:39,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 20:32:39,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 20:32:39,355 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 20:32:39,356 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 20:32:39,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 20:32:39,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 20:32:39,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 20:32:39,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 20:32:39,358 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 -> dff7a34f126cebfd70209ee3091c1d26d4a312400d5536a6607b8d06fec542a2 [2024-11-20 20:32:39,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 20:32:39,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 20:32:39,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 20:32:39,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 20:32:39,706 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 20:32:39,707 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_15_bad.i [2024-11-20 20:32:41,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 20:32:41,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 20:32:41,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-20 20:32:41,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37fdf8951/b4dcb1d222044d8f9be9b9e119f8c982/FLAGa365936a0 [2024-11-20 20:32:41,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37fdf8951/b4dcb1d222044d8f9be9b9e119f8c982 [2024-11-20 20:32:41,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 20:32:41,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 20:32:41,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 20:32:41,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 20:32:41,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 20:32:41,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90c34cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:41, skipping insertion in model container [2024-11-20 20:32:41,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:32:41" (1/1) ... [2024-11-20 20:32:41,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 20:32:42,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:32:42,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 20:32:42,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 20:32:42,978 INFO L204 MainTranslator]: Completed translation [2024-11-20 20:32:42,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:42 WrapperNode [2024-11-20 20:32:42,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 20:32:42,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 20:32:42,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 20:32:42,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 20:32:42,986 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:42" (1/1) ... [2024-11-20 20:32:43,018 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:42" (1/1) ... [2024-11-20 20:32:43,041 INFO L138 Inliner]: procedures = 502, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-20 20:32:43,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 20:32:43,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 20:32:43,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 20:32:43,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 20:32:43,052 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:42" (1/1) ... [2024-11-20 20:32:43,052 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:42" (1/1) ... [2024-11-20 20:32:43,056 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:42" (1/1) ... [2024-11-20 20:32:43,072 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-20 20:32:43,072 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:42" (1/1) ... [2024-11-20 20:32:43,073 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:42" (1/1) ... [2024-11-20 20:32:43,079 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:42" (1/1) ... [2024-11-20 20:32:43,081 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:42" (1/1) ... [2024-11-20 20:32:43,086 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:42" (1/1) ... [2024-11-20 20:32:43,094 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:42" (1/1) ... [2024-11-20 20:32:43,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 20:32:43,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 20:32:43,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 20:32:43,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 20:32:43,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:42" (1/1) ... [2024-11-20 20:32:43,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 20:32:43,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 20:32:43,128 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:43,135 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:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-20 20:32:43,172 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-20 20:32:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 20:32:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 20:32:43,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 20:32:43,325 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 20:32:43,327 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 20:32:43,497 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-20 20:32:43,498 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 20:32:43,514 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 20:32:43,514 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 20:32:43,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:43 BoogieIcfgContainer [2024-11-20 20:32:43,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 20:32:43,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 20:32:43,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 20:32:43,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 20:32:43,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:32:41" (1/3) ... [2024-11-20 20:32:43,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba071ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:32:43, skipping insertion in model container [2024-11-20 20:32:43,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:32:42" (2/3) ... [2024-11-20 20:32:43,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba071ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:32:43, skipping insertion in model container [2024-11-20 20:32:43,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:32:43" (3/3) ... [2024-11-20 20:32:43,527 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-20 20:32:43,544 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 20:32:43,545 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 20:32:43,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 20:32:43,617 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;@7c2c92bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 20:32:43,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 20:32:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-20 20:32:43,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 20:32:43,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:43,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:43,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:43,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash 56724319, now seen corresponding path program 1 times [2024-11-20 20:32:43,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:32:43,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625698804] [2024-11-20 20:32:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:43,651 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:43,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:32:43,654 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:43,656 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:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:43,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 20:32:43,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 20:32:43,791 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:43,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 20:32:43,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 20:32:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625698804] [2024-11-20 20:32:43,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625698804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:32:43,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:32:43,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 20:32:43,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775753001] [2024-11-20 20:32:43,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:32:43,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 20:32:43,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 20:32:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 20:32:43,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 20:32:43,826 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:32:43,843 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-20 20:32:43,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 20:32:43,844 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-20 20:32:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:32:43,850 INFO L225 Difference]: With dead ends: 29 [2024-11-20 20:32:43,850 INFO L226 Difference]: Without dead ends: 18 [2024-11-20 20:32:43,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 20:32:43,858 INFO L432 NwaCegarLoop]: 36 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, 36 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:43,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 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:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-20 20:32:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-20 20:32:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 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:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-20 20:32:43,895 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2024-11-20 20:32:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:32:43,896 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-20 20:32:43,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-20 20:32:43,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 20:32:43,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:43,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:43,904 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:44,103 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:44,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:44,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1758453958, now seen corresponding path program 1 times [2024-11-20 20:32:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:32:44,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758051782] [2024-11-20 20:32:44,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:44,105 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:44,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:32:44,108 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:44,110 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:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 20:32:44,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 20:32:44,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 20:32:44,221 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:44,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 20:32:44,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 20:32:44,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758051782] [2024-11-20 20:32:44,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758051782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 20:32:44,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 20:32:44,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 20:32:44,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651388886] [2024-11-20 20:32:44,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 20:32:44,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 20:32:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 20:32:44,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 20:32:44,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:32:44,227 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 20:32:44,237 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-20 20:32:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 20:32:44,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-20 20:32:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 20:32:44,238 INFO L225 Difference]: With dead ends: 27 [2024-11-20 20:32:44,238 INFO L226 Difference]: Without dead ends: 16 [2024-11-20 20:32:44,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 20:32:44,240 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 20:32:44,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 20:32:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-20 20:32:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-20 20:32:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-20 20:32:44,245 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2024-11-20 20:32:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 20:32:44,245 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-20 20:32:44,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 20:32:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-20 20:32:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 20:32:44,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 20:32:44,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 20:32:44,251 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:44,450 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:44,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-20 20:32:44,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 20:32:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1072976997, now seen corresponding path program 1 times [2024-11-20 20:32:44,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 20:32:44,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941643418] [2024-11-20 20:32:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 20:32:44,453 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:44,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 20:32:44,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 20:32:44,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 20:32:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:32:44,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 20:32:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 20:32:44,594 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 20:32:44,595 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 20:32:44,596 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-20 20:32:44,598 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-20 20:32:44,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 20:32:44,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 20:32:44,806 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 20:32:44,848 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 20:32:44,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:32:44 BoogieIcfgContainer [2024-11-20 20:32:44,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 20:32:44,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 20:32:44,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 20:32:44,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 20:32:44,853 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:43" (3/4) ... [2024-11-20 20:32:44,859 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 20:32:44,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 20:32:44,865 INFO L158 Benchmark]: Toolchain (without parser) took 3066.39ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 40.9MB in the beginning and 56.0MB in the end (delta: -15.0MB). Peak memory consumption was 601.1kB. Max. memory is 16.1GB. [2024-11-20 20:32:44,865 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 50.3MB. Free memory is still 27.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:44,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1179.59ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 40.8MB in the beginning and 39.7MB in the end (delta: 1.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-20 20:32:44,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.33ms. Allocated memory is still 86.0MB. Free memory was 39.7MB in the beginning and 36.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 20:32:44,867 INFO L158 Benchmark]: Boogie Preprocessor took 55.70ms. Allocated memory is still 86.0MB. Free memory was 36.4MB in the beginning and 58.8MB in the end (delta: -22.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-20 20:32:44,867 INFO L158 Benchmark]: RCFGBuilder took 416.30ms. Allocated memory is still 86.0MB. Free memory was 58.8MB in the beginning and 43.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 20:32:44,867 INFO L158 Benchmark]: TraceAbstraction took 1334.99ms. Allocated memory is still 86.0MB. Free memory was 43.1MB in the beginning and 56.5MB in the end (delta: -13.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-20 20:32:44,868 INFO L158 Benchmark]: Witness Printer took 11.63ms. Allocated memory is still 86.0MB. Free memory was 56.5MB in the beginning and 56.0MB in the end (delta: 497.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 20:32:44,874 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.84ms. Allocated memory is still 50.3MB. Free memory is still 27.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1179.59ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 40.8MB in the beginning and 39.7MB in the end (delta: 1.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.33ms. Allocated memory is still 86.0MB. Free memory was 39.7MB in the beginning and 36.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.70ms. Allocated memory is still 86.0MB. Free memory was 36.4MB in the beginning and 58.8MB in the end (delta: -22.4MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * RCFGBuilder took 416.30ms. Allocated memory is still 86.0MB. Free memory was 58.8MB in the beginning and 43.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1334.99ms. Allocated memory is still 86.0MB. Free memory was 43.1MB in the beginning and 56.5MB in the end (delta: -13.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Witness Printer took 11.63ms. Allocated memory is still 86.0MB. Free memory was 56.5MB in the beginning and 56.0MB in the end (delta: 497.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: 1565]: 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 1578. 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] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] 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] [L1579] CALL CWE190_Integer_Overflow__int_rand_preinc_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: [L1554] case 6: [L1555] 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] [L1555] data = ((int)(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=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1563] case 7: VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1565] ++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: 1565]: 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, 29 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 52 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 91 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 20:32:44,914 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