./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_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 2248aeabe5be736adf4371a8cabf87839c83084d460e2eb57d2fafbdcc7f0a21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 07:07:17,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 07:07:17,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-17 07:07:17,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 07:07:17,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 07:07:17,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 07:07:17,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 07:07:17,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 07:07:17,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 07:07:17,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 07:07:17,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 07:07:17,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 07:07:17,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 07:07:17,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 07:07:17,226 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 07:07:17,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 07:07:17,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 07:07:17,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 07:07:17,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 07:07:17,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 07:07:17,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 07:07:17,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 07:07:17,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 07:07:17,231 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 07:07:17,231 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 07:07:17,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 07:07:17,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 07:07:17,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 07:07:17,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 07:07:17,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 07:07:17,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 07:07:17,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:07:17,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 07:07:17,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 07:07:17,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 07:07:17,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 07:07:17,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 07:07:17,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 07:07:17,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 07:07:17,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 07:07:17,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 07:07:17,235 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 -> 2248aeabe5be736adf4371a8cabf87839c83084d460e2eb57d2fafbdcc7f0a21 [2024-11-17 07:07:17,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 07:07:17,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 07:07:17,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 07:07:17,516 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 07:07:17,516 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 07:07:17,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-17 07:07:19,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 07:07:19,370 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 07:07:19,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-17 07:07:19,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21977b1ab/620d5379000047928ee4459038b04212/FLAGb7e2db7ad [2024-11-17 07:07:19,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21977b1ab/620d5379000047928ee4459038b04212 [2024-11-17 07:07:19,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 07:07:19,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 07:07:19,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 07:07:19,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 07:07:19,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 07:07:19,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:07:19" (1/1) ... [2024-11-17 07:07:19,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a88d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:19, skipping insertion in model container [2024-11-17 07:07:19,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:07:19" (1/1) ... [2024-11-17 07:07:19,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 07:07:20,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:07:20,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 07:07:20,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:07:20,879 INFO L204 MainTranslator]: Completed translation [2024-11-17 07:07:20,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20 WrapperNode [2024-11-17 07:07:20,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 07:07:20,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 07:07:20,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 07:07:20,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 07:07:20,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,941 INFO L138 Inliner]: procedures = 497, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2024-11-17 07:07:20,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 07:07:20,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 07:07:20,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 07:07:20,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 07:07:20,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,972 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 07:07:20,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,977 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 07:07:20,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 07:07:20,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 07:07:20,984 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 07:07:20,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (1/1) ... [2024-11-17 07:07:20,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:07:21,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:07:21,024 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-17 07:07:21,026 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-17 07:07:21,070 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-17 07:07:21,071 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-17 07:07:21,071 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-17 07:07:21,071 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-17 07:07:21,071 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 07:07:21,071 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 07:07:21,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 07:07:21,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 07:07:21,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 07:07:21,238 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 07:07:21,240 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 07:07:21,286 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet87; [2024-11-17 07:07:21,473 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-17 07:07:21,473 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 07:07:21,506 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 07:07:21,506 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 07:07:21,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:07:21 BoogieIcfgContainer [2024-11-17 07:07:21,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 07:07:21,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 07:07:21,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 07:07:21,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 07:07:21,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 07:07:19" (1/3) ... [2024-11-17 07:07:21,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d48dfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:07:21, skipping insertion in model container [2024-11-17 07:07:21,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:20" (2/3) ... [2024-11-17 07:07:21,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d48dfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:07:21, skipping insertion in model container [2024-11-17 07:07:21,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:07:21" (3/3) ... [2024-11-17 07:07:21,517 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-17 07:07:21,533 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 07:07:21,534 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-17 07:07:21,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 07:07:21,611 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;@505d461e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 07:07:21,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 07:07:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 54 states have internal predecessors, (71), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 07:07:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 07:07:21,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:07:21,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:07:21,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 07:07:21,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:07:21,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1097928175, now seen corresponding path program 1 times [2024-11-17 07:07:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:07:21,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534247704] [2024-11-17 07:07:21,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:07:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:07:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:21,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 07:07:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 07:07:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 07:07:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 07:07:22,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:07:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534247704] [2024-11-17 07:07:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534247704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:07:22,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:07:22,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:07:22,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197831555] [2024-11-17 07:07:22,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:07:22,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:07:22,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:07:22,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:07:22,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:22,077 INFO L87 Difference]: Start difference. First operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 54 states have internal predecessors, (71), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:22,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:07:22,183 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2024-11-17 07:07:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:07:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-17 07:07:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:07:22,192 INFO L225 Difference]: With dead ends: 85 [2024-11-17 07:07:22,192 INFO L226 Difference]: Without dead ends: 54 [2024-11-17 07:07:22,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:22,197 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 3 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:07:22,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 218 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:07:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-17 07:07:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-17 07:07:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 45 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 07:07:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 69 transitions. [2024-11-17 07:07:22,233 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 69 transitions. Word has length 21 [2024-11-17 07:07:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:07:22,235 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 69 transitions. [2024-11-17 07:07:22,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 69 transitions. [2024-11-17 07:07:22,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 07:07:22,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:07:22,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:07:22,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 07:07:22,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 07:07:22,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:07:22,239 INFO L85 PathProgramCache]: Analyzing trace with hash -323953104, now seen corresponding path program 1 times [2024-11-17 07:07:22,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:07:22,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773345657] [2024-11-17 07:07:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:07:22,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:07:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 07:07:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 07:07:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 07:07:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 07:07:22,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:07:22,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773345657] [2024-11-17 07:07:22,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773345657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:07:22,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:07:22,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:07:22,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237311298] [2024-11-17 07:07:22,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:07:22,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:07:22,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:07:22,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:07:22,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:22,408 INFO L87 Difference]: Start difference. First operand 52 states and 69 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:07:22,456 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2024-11-17 07:07:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:07:22,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-17 07:07:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:07:22,457 INFO L225 Difference]: With dead ends: 56 [2024-11-17 07:07:22,457 INFO L226 Difference]: Without dead ends: 55 [2024-11-17 07:07:22,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:22,459 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:07:22,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 161 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:07:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-17 07:07:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-11-17 07:07:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 47 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 07:07:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2024-11-17 07:07:22,475 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 22 [2024-11-17 07:07:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:07:22,475 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2024-11-17 07:07:22,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2024-11-17 07:07:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 07:07:22,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:07:22,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:07:22,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 07:07:22,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 07:07:22,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:07:22,479 INFO L85 PathProgramCache]: Analyzing trace with hash -323964956, now seen corresponding path program 1 times [2024-11-17 07:07:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:07:22,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171960740] [2024-11-17 07:07:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:07:22,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:07:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 07:07:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 07:07:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 07:07:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 07:07:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:07:22,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171960740] [2024-11-17 07:07:22,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171960740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:07:22,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:07:22,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:07:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789757793] [2024-11-17 07:07:22,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:07:22,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:07:22,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:07:22,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:07:22,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:22,599 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:22,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:07:22,642 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-11-17 07:07:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:07:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-17 07:07:22,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:07:22,644 INFO L225 Difference]: With dead ends: 56 [2024-11-17 07:07:22,646 INFO L226 Difference]: Without dead ends: 53 [2024-11-17 07:07:22,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:22,648 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:07:22,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 174 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:07:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-17 07:07:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-17 07:07:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 46 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 07:07:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2024-11-17 07:07:22,659 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 22 [2024-11-17 07:07:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:07:22,660 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2024-11-17 07:07:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2024-11-17 07:07:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 07:07:22,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:07:22,661 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:07:22,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 07:07:22,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 07:07:22,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:07:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1452611637, now seen corresponding path program 1 times [2024-11-17 07:07:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:07:22,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927512683] [2024-11-17 07:07:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:07:22,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:07:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 07:07:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 07:07:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-17 07:07:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 07:07:22,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:07:22,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927512683] [2024-11-17 07:07:22,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927512683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:07:22,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:07:22,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:07:22,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839449642] [2024-11-17 07:07:22,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:07:22,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:07:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:07:22,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:07:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:22,772 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:07:22,808 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-11-17 07:07:22,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:07:22,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-17 07:07:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:07:22,810 INFO L225 Difference]: With dead ends: 55 [2024-11-17 07:07:22,810 INFO L226 Difference]: Without dead ends: 48 [2024-11-17 07:07:22,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:22,812 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:07:22,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:07:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-17 07:07:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-17 07:07:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.435897435897436) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:07:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-11-17 07:07:22,818 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 23 [2024-11-17 07:07:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:07:22,818 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-11-17 07:07:22,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-11-17 07:07:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 07:07:22,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:07:22,819 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:07:22,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 07:07:22,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 07:07:22,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:07:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash 699912129, now seen corresponding path program 1 times [2024-11-17 07:07:22,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:07:22,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006286061] [2024-11-17 07:07:22,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:07:22,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:07:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-17 07:07:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:23,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-17 07:07:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-17 07:07:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 07:07:23,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 07:07:23,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006286061] [2024-11-17 07:07:23,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006286061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:07:23,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:07:23,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 07:07:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459103809] [2024-11-17 07:07:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:07:23,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 07:07:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 07:07:23,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 07:07:23,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:07:23,095 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:07:23,183 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-11-17 07:07:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 07:07:23,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-17 07:07:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:07:23,184 INFO L225 Difference]: With dead ends: 57 [2024-11-17 07:07:23,185 INFO L226 Difference]: Without dead ends: 56 [2024-11-17 07:07:23,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 07:07:23,186 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 07:07:23,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 308 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 07:07:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-17 07:07:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-11-17 07:07:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 47 states have internal predecessors, (62), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 07:07:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2024-11-17 07:07:23,207 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 27 [2024-11-17 07:07:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:07:23,208 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-11-17 07:07:23,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-11-17 07:07:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 07:07:23,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:07:23,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:07:23,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 07:07:23,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 07:07:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:07:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1625196524, now seen corresponding path program 1 times [2024-11-17 07:07:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 07:07:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881120573] [2024-11-17 07:07:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:07:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 07:07:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:07:23,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 07:07:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:07:23,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 07:07:23,287 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 07:07:23,288 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-17 07:07:23,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-17 07:07:23,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-17 07:07:23,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-17 07:07:23,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 07:07:23,295 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-17 07:07:23,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 07:07:23,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 07:07:23 BoogieIcfgContainer [2024-11-17 07:07:23,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 07:07:23,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 07:07:23,334 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 07:07:23,334 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 07:07:23,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:07:21" (3/4) ... [2024-11-17 07:07:23,340 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 07:07:23,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 07:07:23,344 INFO L158 Benchmark]: Toolchain (without parser) took 3718.92ms. Allocated memory is still 180.4MB. Free memory was 107.1MB in the beginning and 135.7MB in the end (delta: -28.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:07:23,344 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:07:23,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1253.88ms. Allocated memory is still 180.4MB. Free memory was 106.7MB in the beginning and 117.8MB in the end (delta: -11.1MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-11-17 07:07:23,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.82ms. Allocated memory is still 180.4MB. Free memory was 117.8MB in the beginning and 114.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 07:07:23,346 INFO L158 Benchmark]: Boogie Preprocessor took 39.27ms. Allocated memory is still 180.4MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 07:07:23,346 INFO L158 Benchmark]: IcfgBuilder took 522.92ms. Allocated memory is still 180.4MB. Free memory was 112.4MB in the beginning and 91.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-17 07:07:23,346 INFO L158 Benchmark]: TraceAbstraction took 1824.83ms. Allocated memory is still 180.4MB. Free memory was 91.4MB in the beginning and 135.7MB in the end (delta: -44.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:07:23,347 INFO L158 Benchmark]: Witness Printer took 8.54ms. Allocated memory is still 180.4MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:07:23,348 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1253.88ms. Allocated memory is still 180.4MB. Free memory was 106.7MB in the beginning and 117.8MB in the end (delta: -11.1MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.82ms. Allocated memory is still 180.4MB. Free memory was 117.8MB in the beginning and 114.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.27ms. Allocated memory is still 180.4MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 522.92ms. Allocated memory is still 180.4MB. Free memory was 112.4MB in the beginning and 91.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1824.83ms. Allocated memory is still 180.4MB. Free memory was 91.4MB in the beginning and 135.7MB in the end (delta: -44.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 8.54ms. Allocated memory is still 180.4MB. Free memory is still 135.7MB. 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: 1563]: 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 1585. 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] [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] 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] [L1586] CALL CWE191_Integer_Underflow__int_rand_postdec_12_bad() [L1550] int data; [L1551] data = 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] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] 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: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: 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 4 procedures, 65 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 1035 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 727 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 209 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 308 mSDtfsCounter, 209 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 15/15 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-17 07:07:23,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_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 2248aeabe5be736adf4371a8cabf87839c83084d460e2eb57d2fafbdcc7f0a21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 07:07:25,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 07:07:25,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-17 07:07:25,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 07:07:25,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 07:07:25,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-17 07:07:25,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 07:07:25,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 07:07:25,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 07:07:25,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 07:07:25,881 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 07:07:25,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 07:07:25,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 07:07:25,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 07:07:25,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 07:07:25,883 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 07:07:25,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 07:07:25,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 07:07:25,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 07:07:25,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 07:07:25,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 07:07:25,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 07:07:25,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 07:07:25,889 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 07:07:25,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 07:07:25,889 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-17 07:07:25,889 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 07:07:25,890 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 07:07:25,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 07:07:25,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 07:07:25,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 07:07:25,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 07:07:25,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 07:07:25,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 07:07:25,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:07:25,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 07:07:25,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 07:07:25,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-17 07:07:25,893 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 07:07:25,893 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 07:07:25,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 07:07:25,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 07:07:25,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 07:07:25,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 07:07:25,895 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 -> 2248aeabe5be736adf4371a8cabf87839c83084d460e2eb57d2fafbdcc7f0a21 [2024-11-17 07:07:26,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 07:07:26,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 07:07:26,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 07:07:26,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 07:07:26,250 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 07:07:26,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-17 07:07:27,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 07:07:28,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 07:07:28,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-17 07:07:28,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0630c1fd8/b8bb0b83e0f3459086bf7405774544d7/FLAG76399011f [2024-11-17 07:07:28,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0630c1fd8/b8bb0b83e0f3459086bf7405774544d7 [2024-11-17 07:07:28,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 07:07:28,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 07:07:28,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 07:07:28,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 07:07:28,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 07:07:28,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:07:28" (1/1) ... [2024-11-17 07:07:28,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ab868d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:28, skipping insertion in model container [2024-11-17 07:07:28,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 07:07:28" (1/1) ... [2024-11-17 07:07:28,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 07:07:29,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:07:29,334 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 07:07:29,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 07:07:29,610 INFO L204 MainTranslator]: Completed translation [2024-11-17 07:07:29,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29 WrapperNode [2024-11-17 07:07:29,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 07:07:29,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 07:07:29,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 07:07:29,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 07:07:29,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,689 INFO L138 Inliner]: procedures = 502, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-17 07:07:29,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 07:07:29,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 07:07:29,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 07:07:29,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 07:07:29,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,737 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 07:07:29,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 07:07:29,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 07:07:29,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 07:07:29,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 07:07:29,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (1/1) ... [2024-11-17 07:07:29,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 07:07:29,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 07:07:29,803 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-17 07:07:29,806 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-17 07:07:29,848 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-11-17 07:07:29,848 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-11-17 07:07:29,848 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrueOrFalse [2024-11-17 07:07:29,848 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrueOrFalse [2024-11-17 07:07:29,848 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-17 07:07:29,848 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-17 07:07:29,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 07:07:29,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 07:07:29,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 07:07:30,001 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 07:07:30,005 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 07:07:30,054 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520: havoc #t~nondet83; [2024-11-17 07:07:30,187 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-17 07:07:30,187 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 07:07:30,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 07:07:30,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 07:07:30,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:07:30 BoogieIcfgContainer [2024-11-17 07:07:30,202 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 07:07:30,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 07:07:30,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 07:07:30,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 07:07:30,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 07:07:28" (1/3) ... [2024-11-17 07:07:30,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:07:30, skipping insertion in model container [2024-11-17 07:07:30,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 07:07:29" (2/3) ... [2024-11-17 07:07:30,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 07:07:30, skipping insertion in model container [2024-11-17 07:07:30,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:07:30" (3/3) ... [2024-11-17 07:07:30,213 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_12_bad.i [2024-11-17 07:07:30,228 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 07:07:30,229 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-17 07:07:30,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 07:07:30,301 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;@4ad73df9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 07:07:30,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-17 07:07:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 07:07:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 07:07:30,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:07:30,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:07:30,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 07:07:30,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:07:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2046713779, now seen corresponding path program 1 times [2024-11-17 07:07:30,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:07:30,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843996920] [2024-11-17 07:07:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:07:30,336 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-17 07:07:30,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:07:30,339 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-17 07:07:30,340 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-17 07:07:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:30,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:07:30,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:07:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 07:07:30,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:07:30,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:07:30,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843996920] [2024-11-17 07:07:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843996920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:07:30,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:07:30,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:07:30,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141724439] [2024-11-17 07:07:30,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:07:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:07:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:07:30,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:07:30,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:30,593 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:07:30,647 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-11-17 07:07:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:07:30,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-11-17 07:07:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:07:30,655 INFO L225 Difference]: With dead ends: 62 [2024-11-17 07:07:30,655 INFO L226 Difference]: Without dead ends: 25 [2024-11-17 07:07:30,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:30,661 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:07:30,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 138 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:07:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-17 07:07:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-17 07:07:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-17 07:07:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-17 07:07:30,703 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2024-11-17 07:07:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:07:30,704 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-17 07:07:30,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-17 07:07:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 07:07:30,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:07:30,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:07:30,711 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-17 07:07:30,911 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-17 07:07:30,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 07:07:30,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:07:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 976394130, now seen corresponding path program 1 times [2024-11-17 07:07:30,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:07:30,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202131349] [2024-11-17 07:07:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:07:30,913 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-17 07:07:30,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:07:30,915 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-17 07:07:30,931 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-17 07:07:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 07:07:30,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 07:07:30,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 07:07:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 07:07:31,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 07:07:31,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 07:07:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202131349] [2024-11-17 07:07:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202131349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 07:07:31,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 07:07:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 07:07:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545154444] [2024-11-17 07:07:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 07:07:31,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 07:07:31,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 07:07:31,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 07:07:31,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:31,058 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 07:07:31,076 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-17 07:07:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 07:07:31,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-17 07:07:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 07:07:31,077 INFO L225 Difference]: With dead ends: 27 [2024-11-17 07:07:31,078 INFO L226 Difference]: Without dead ends: 22 [2024-11-17 07:07:31,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 07:07:31,080 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 07:07:31,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 07:07:31,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-17 07:07:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-17 07:07:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 07:07:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-17 07:07:31,092 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2024-11-17 07:07:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 07:07:31,096 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-17 07:07:31,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 07:07:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-17 07:07:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 07:07:31,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 07:07:31,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 07:07:31,104 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-17 07:07:31,298 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-17 07:07:31,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-17 07:07:31,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 07:07:31,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1407330549, now seen corresponding path program 1 times [2024-11-17 07:07:31,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 07:07:31,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038754669] [2024-11-17 07:07:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 07:07:31,304 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-17 07:07:31,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 07:07:31,308 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-17 07:07:31,311 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-17 07:07:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:07:31,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 07:07:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 07:07:31,473 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 07:07:31,474 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 07:07:31,475 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-17 07:07:31,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-17 07:07:31,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-17 07:07:31,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-17 07:07:31,481 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 (4)] Forceful destruction successful, exit code 0 [2024-11-17 07:07:31,677 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-17 07:07:31,681 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 07:07:31,702 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 07:07:31,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 07:07:31 BoogieIcfgContainer [2024-11-17 07:07:31,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 07:07:31,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 07:07:31,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 07:07:31,706 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 07:07:31,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 07:07:30" (3/4) ... [2024-11-17 07:07:31,709 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 07:07:31,710 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 07:07:31,711 INFO L158 Benchmark]: Toolchain (without parser) took 3279.91ms. Allocated memory was 58.7MB in the beginning and 90.2MB in the end (delta: 31.5MB). Free memory was 26.4MB in the beginning and 45.9MB in the end (delta: -19.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-17 07:07:31,711 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 58.7MB. Free memory was 43.1MB in the beginning and 43.1MB in the end (delta: 51.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:07:31,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1179.57ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 26.2MB in the beginning and 29.8MB in the end (delta: -3.6MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-11-17 07:07:31,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.30ms. Allocated memory is still 73.4MB. Free memory was 29.8MB in the beginning and 26.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 07:07:31,713 INFO L158 Benchmark]: Boogie Preprocessor took 73.11ms. Allocated memory is still 73.4MB. Free memory was 26.4MB in the beginning and 24.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 07:07:31,713 INFO L158 Benchmark]: IcfgBuilder took 437.36ms. Allocated memory is still 73.4MB. Free memory was 23.6MB in the beginning and 29.7MB in the end (delta: -6.1MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-17 07:07:31,713 INFO L158 Benchmark]: TraceAbstraction took 1501.01ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 29.0MB in the beginning and 45.9MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:07:31,714 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 90.2MB. Free memory is still 45.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 07:07:31,716 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.20ms. Allocated memory is still 58.7MB. Free memory was 43.1MB in the beginning and 43.1MB in the end (delta: 51.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1179.57ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 26.2MB in the beginning and 29.8MB in the end (delta: -3.6MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.30ms. Allocated memory is still 73.4MB. Free memory was 29.8MB in the beginning and 26.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.11ms. Allocated memory is still 73.4MB. Free memory was 26.4MB in the beginning and 24.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 437.36ms. Allocated memory is still 73.4MB. Free memory was 23.6MB in the beginning and 29.7MB in the end (delta: -6.1MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1501.01ms. Allocated memory was 73.4MB in the beginning and 90.2MB in the end (delta: 16.8MB). Free memory was 29.0MB in the beginning and 45.9MB in the end (delta: -17.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 90.2MB. Free memory is still 45.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: 1563]: 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 1585. 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] [L1585] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={2:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1585] 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] [L1586] CALL CWE191_Integer_Underflow__int_rand_postdec_12_bad() [L1550] int data; [L1551] data = 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] [L1552] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1552] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1552] COND TRUE globalReturnsTrueOrFalse() [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1554] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1560] CALL globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1520] return (rand() % 2); [L1560] RET globalReturnsTrueOrFalse() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=-2147483648, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1560] COND TRUE globalReturnsTrueOrFalse() [L1563] 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: 1563]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1572]: 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 4 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 78 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 6/6 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-17 07:07:31,750 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