./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_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 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:05:07,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:05:08,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-24 22:05:08,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:05:08,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:05:08,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:05:08,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:05:08,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:05:08,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:05:08,055 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:05:08,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:05:08,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:05:08,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:05:08,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:05:08,059 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:05:08,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:05:08,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:05:08,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 22:05:08,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:05:08,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:05:08,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:05:08,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:05:08,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:05:08,065 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:05:08,065 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:05:08,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:05:08,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:05:08,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:05:08,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:05:08,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:05:08,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:05:08,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:08,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:05:08,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:05:08,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:05:08,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 22:05:08,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 22:05:08,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:05:08,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:05:08,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:05:08,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:05:08,069 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 -> 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b [2024-10-24 22:05:08,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:05:08,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:05:08,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:05:08,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:05:08,409 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:05:08,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-10-24 22:05:09,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:05:10,290 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:05:10,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-10-24 22:05:10,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3fbdc4ac/6168d956d8a54aa29589188c2b0eebc7/FLAGc7e3ebf73 [2024-10-24 22:05:10,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3fbdc4ac/6168d956d8a54aa29589188c2b0eebc7 [2024-10-24 22:05:10,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:05:10,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:05:10,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:10,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:05:10,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:05:10,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:10" (1/1) ... [2024-10-24 22:05:10,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17911e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:10, skipping insertion in model container [2024-10-24 22:05:10,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:10" (1/1) ... [2024-10-24 22:05:10,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:05:11,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:11,247 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:05:11,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:11,492 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:05:11,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11 WrapperNode [2024-10-24 22:05:11,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:11,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:11,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:05:11,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:05:11,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,559 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2024-10-24 22:05:11,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:11,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:05:11,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:05:11,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:05:11,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,585 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 22:05:11,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:05:11,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:05:11,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:05:11,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:05:11,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (1/1) ... [2024-10-24 22:05:11,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:11,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:05:11,651 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-10-24 22:05:11,657 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-10-24 22:05:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:05:11,701 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:05:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:05:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:05:11,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:05:11,856 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:05:11,858 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:05:12,114 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-10-24 22:05:12,118 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:05:12,143 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:05:12,143 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 22:05:12,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:12 BoogieIcfgContainer [2024-10-24 22:05:12,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:05:12,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:05:12,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:05:12,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:05:12,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:05:10" (1/3) ... [2024-10-24 22:05:12,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11eac2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:12, skipping insertion in model container [2024-10-24 22:05:12,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:11" (2/3) ... [2024-10-24 22:05:12,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11eac2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:12, skipping insertion in model container [2024-10-24 22:05:12,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:12" (3/3) ... [2024-10-24 22:05:12,157 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-10-24 22:05:12,172 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:05:12,172 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-24 22:05:12,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:05:12,225 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;@4b5aa1ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:05:12,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 22:05:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 40 states have (on average 1.625) internal successors, (65), 46 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 22:05:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 22:05:12,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:12,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:12,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:12,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash -654813642, now seen corresponding path program 1 times [2024-10-24 22:05:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:12,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827060768] [2024-10-24 22:05:12,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:12,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:05:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:12,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:05:12,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827060768] [2024-10-24 22:05:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827060768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:12,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:12,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 22:05:12,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332064812] [2024-10-24 22:05:12,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:12,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:05:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:05:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:05:12,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:12,562 INFO L87 Difference]: Start difference. First operand has 50 states, 40 states have (on average 1.625) internal successors, (65), 46 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:12,620 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2024-10-24 22:05:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:05:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-24 22:05:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:12,630 INFO L225 Difference]: With dead ends: 93 [2024-10-24 22:05:12,631 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 22:05:12,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:12,639 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:12,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 120 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 22:05:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2024-10-24 22:05:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.564102564102564) internal successors, (61), 44 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2024-10-24 22:05:12,685 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 12 [2024-10-24 22:05:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:12,685 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2024-10-24 22:05:12,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2024-10-24 22:05:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 22:05:12,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:12,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:12,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 22:05:12,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:12,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1977521748, now seen corresponding path program 1 times [2024-10-24 22:05:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298640226] [2024-10-24 22:05:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:05:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:12,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:05:12,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298640226] [2024-10-24 22:05:12,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298640226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:12,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:12,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 22:05:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131619221] [2024-10-24 22:05:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:12,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 22:05:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:05:12,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 22:05:12,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 22:05:12,943 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:12,996 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-10-24 22:05:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 22:05:12,996 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-24 22:05:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:13,001 INFO L225 Difference]: With dead ends: 73 [2024-10-24 22:05:13,001 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 22:05:13,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-24 22:05:13,003 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 30 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:13,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 163 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 22:05:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-24 22:05:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 68 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-10-24 22:05:13,017 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 15 [2024-10-24 22:05:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:13,017 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-10-24 22:05:13,017 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-10-24 22:05:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 22:05:13,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:13,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:13,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 22:05:13,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:13,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:13,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1122342279, now seen corresponding path program 1 times [2024-10-24 22:05:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:13,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252124219] [2024-10-24 22:05:13,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:13,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:13,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:05:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 22:05:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:05:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252124219] [2024-10-24 22:05:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252124219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:13,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:13,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:05:13,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875586588] [2024-10-24 22:05:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:13,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:05:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:05:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:05:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:13,121 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:13,151 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2024-10-24 22:05:13,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:05:13,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-24 22:05:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:13,154 INFO L225 Difference]: With dead ends: 88 [2024-10-24 22:05:13,154 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 22:05:13,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:13,156 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:13,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 115 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 22:05:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2024-10-24 22:05:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 72 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 106 transitions. [2024-10-24 22:05:13,177 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 106 transitions. Word has length 21 [2024-10-24 22:05:13,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:13,177 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 106 transitions. [2024-10-24 22:05:13,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2024-10-24 22:05:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 22:05:13,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:13,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:13,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 22:05:13,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:13,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 432880379, now seen corresponding path program 1 times [2024-10-24 22:05:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631887300] [2024-10-24 22:05:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 22:05:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 22:05:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 22:05:13,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631887300] [2024-10-24 22:05:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631887300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:13,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:13,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 22:05:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522593685] [2024-10-24 22:05:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:13,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 22:05:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 22:05:13,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 22:05:13,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 22:05:13,289 INFO L87 Difference]: Start difference. First operand 75 states and 106 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:13,335 INFO L93 Difference]: Finished difference Result 88 states and 122 transitions. [2024-10-24 22:05:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 22:05:13,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-24 22:05:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:13,337 INFO L225 Difference]: With dead ends: 88 [2024-10-24 22:05:13,337 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 22:05:13,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-24 22:05:13,339 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:13,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 157 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 22:05:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-24 22:05:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 82 states have internal predecessors, (116), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 118 transitions. [2024-10-24 22:05:13,349 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 118 transitions. Word has length 22 [2024-10-24 22:05:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:13,349 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 118 transitions. [2024-10-24 22:05:13,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2024-10-24 22:05:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-24 22:05:13,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:13,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:13,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 22:05:13,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:13,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash 432872435, now seen corresponding path program 1 times [2024-10-24 22:05:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 22:05:13,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987246073] [2024-10-24 22:05:13,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 22:05:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:13,373 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:05:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:13,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 22:05:13,420 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:05:13,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-24 22:05:13,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-24 22:05:13,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-24 22:05:13,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-24 22:05:13,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-24 22:05:13,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-24 22:05:13,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 22:05:13,430 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 22:05:13,466 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:05:13,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:05:13 BoogieIcfgContainer [2024-10-24 22:05:13,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:05:13,474 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:05:13,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:05:13,478 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:05:13,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:12" (3/4) ... [2024-10-24 22:05:13,480 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:05:13,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:05:13,482 INFO L158 Benchmark]: Toolchain (without parser) took 2990.67ms. Allocated memory was 165.7MB in the beginning and 230.7MB in the end (delta: 65.0MB). Free memory was 129.1MB in the beginning and 148.9MB in the end (delta: -19.8MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2024-10-24 22:05:13,483 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 130.2MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:13,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1000.59ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 120.7MB in the end (delta: 7.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-24 22:05:13,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.34ms. Allocated memory is still 165.7MB. Free memory was 120.7MB in the beginning and 116.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 22:05:13,484 INFO L158 Benchmark]: Boogie Preprocessor took 44.76ms. Allocated memory is still 165.7MB. Free memory was 116.8MB in the beginning and 114.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:13,484 INFO L158 Benchmark]: RCFGBuilder took 537.61ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 95.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 22:05:13,484 INFO L158 Benchmark]: TraceAbstraction took 1324.26ms. Allocated memory was 165.7MB in the beginning and 230.7MB in the end (delta: 65.0MB). Free memory was 95.8MB in the beginning and 149.9MB in the end (delta: -54.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-10-24 22:05:13,485 INFO L158 Benchmark]: Witness Printer took 7.79ms. Allocated memory is still 230.7MB. Free memory was 149.9MB in the beginning and 148.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:13,487 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.11ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 130.2MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1000.59ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 120.7MB in the end (delta: 7.6MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.34ms. Allocated memory is still 165.7MB. Free memory was 120.7MB in the beginning and 116.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.76ms. Allocated memory is still 165.7MB. Free memory was 116.8MB in the beginning and 114.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 537.61ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 95.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1324.26ms. Allocated memory was 165.7MB in the beginning and 230.7MB in the end (delta: 65.0MB). Free memory was 95.8MB in the beginning and 149.9MB in the end (delta: -54.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Witness Printer took 7.79ms. Allocated memory is still 230.7MB. Free memory was 149.9MB in the beginning and 148.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1561]: 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 1569. 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); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] 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] [L1570] CALL CWE190_Integer_Overflow__int_rand_multiply_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1559] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1561] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 555 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 234 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 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-10-24 22:05:13,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_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 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 22:05:15,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 22:05:15,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-24 22:05:15,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 22:05:15,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 22:05:15,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-24 22:05:15,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 22:05:15,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 22:05:15,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 22:05:15,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 22:05:15,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 22:05:15,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 22:05:15,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 22:05:15,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 22:05:15,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 22:05:15,837 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 22:05:15,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 22:05:15,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 22:05:15,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 22:05:15,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 22:05:15,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 22:05:15,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 22:05:15,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 22:05:15,842 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 22:05:15,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 22:05:15,843 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-24 22:05:15,843 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 22:05:15,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 22:05:15,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 22:05:15,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 22:05:15,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 22:05:15,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 22:05:15,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 22:05:15,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 22:05:15,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:15,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 22:05:15,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 22:05:15,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 22:05:15,847 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 22:05:15,847 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 22:05:15,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 22:05:15,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 22:05:15,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 22:05:15,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 22:05:15,848 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 22:05:15,848 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 -> 6015f04310429ab4af5cc247f2fe29bb2cd32202af3afe790befe48fe196432b [2024-10-24 22:05:16,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 22:05:16,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 22:05:16,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 22:05:16,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 22:05:16,198 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 22:05:16,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-10-24 22:05:17,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 22:05:18,099 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 22:05:18,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-10-24 22:05:18,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46220487/75a79103d0704a9aadb2f0cc3abbb02e/FLAGb89e66bb9 [2024-10-24 22:05:18,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f46220487/75a79103d0704a9aadb2f0cc3abbb02e [2024-10-24 22:05:18,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 22:05:18,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 22:05:18,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:18,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 22:05:18,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 22:05:18,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:18" (1/1) ... [2024-10-24 22:05:18,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5b1a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:18, skipping insertion in model container [2024-10-24 22:05:18,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:05:18" (1/1) ... [2024-10-24 22:05:18,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 22:05:18,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:18,917 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 22:05:19,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 22:05:19,167 INFO L204 MainTranslator]: Completed translation [2024-10-24 22:05:19,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19 WrapperNode [2024-10-24 22:05:19,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 22:05:19,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:19,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 22:05:19,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 22:05:19,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,239 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2024-10-24 22:05:19,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 22:05:19,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 22:05:19,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 22:05:19,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 22:05:19,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,278 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-24 22:05:19,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 22:05:19,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 22:05:19,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 22:05:19,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 22:05:19,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (1/1) ... [2024-10-24 22:05:19,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 22:05:19,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 22:05:19,348 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-10-24 22:05:19,353 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-10-24 22:05:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-24 22:05:19,388 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-24 22:05:19,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 22:05:19,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 22:05:19,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 22:05:19,560 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 22:05:19,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 22:05:19,751 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-24 22:05:19,751 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 22:05:19,783 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 22:05:19,786 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-24 22:05:19,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:19 BoogieIcfgContainer [2024-10-24 22:05:19,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 22:05:19,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 22:05:19,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 22:05:19,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 22:05:19,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:05:18" (1/3) ... [2024-10-24 22:05:19,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4d3a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:19, skipping insertion in model container [2024-10-24 22:05:19,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:05:19" (2/3) ... [2024-10-24 22:05:19,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e4d3a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:05:19, skipping insertion in model container [2024-10-24 22:05:19,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:19" (3/3) ... [2024-10-24 22:05:19,797 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_multiply_17_bad.i [2024-10-24 22:05:19,812 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 22:05:19,813 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-24 22:05:19,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 22:05:19,878 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;@33e0c110, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 22:05:19,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-24 22:05:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.65) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 22:05:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 22:05:19,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:19,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:19,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:19,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1403603363, now seen corresponding path program 1 times [2024-10-24 22:05:19,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:19,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291387056] [2024-10-24 22:05:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:19,910 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-10-24 22:05:19,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:19,913 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-10-24 22:05:19,914 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-10-24 22:05:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:20,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 22:05:20,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:05:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:20,072 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:05:20,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:05:20,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291387056] [2024-10-24 22:05:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291387056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 22:05:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756261459] [2024-10-24 22:05:20,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:20,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 22:05:20,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:05:20,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 22:05:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 22:05:20,108 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.65) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:20,141 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-24 22:05:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 22:05:20,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 22:05:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:20,150 INFO L225 Difference]: With dead ends: 49 [2024-10-24 22:05:20,150 INFO L226 Difference]: Without dead ends: 24 [2024-10-24 22:05:20,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 22:05:20,158 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:20,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-24 22:05:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-24 22:05:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 21 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-24 22:05:20,201 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2024-10-24 22:05:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:20,201 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-24 22:05:20,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 9.0) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-10-24 22:05:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 22:05:20,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:20,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:20,208 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-10-24 22:05:20,403 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-10-24 22:05:20,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:20,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash -563493328, now seen corresponding path program 1 times [2024-10-24 22:05:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:20,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490007666] [2024-10-24 22:05:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:20,405 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-10-24 22:05:20,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:20,407 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-10-24 22:05:20,408 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-10-24 22:05:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:20,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 22:05:20,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:05:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:20,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:05:20,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:05:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490007666] [2024-10-24 22:05:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490007666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:20,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:20,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 22:05:20,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128961602] [2024-10-24 22:05:20,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:20,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:05:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:05:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:05:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:20,502 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:20,520 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-24 22:05:20,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:05:20,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-24 22:05:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:20,522 INFO L225 Difference]: With dead ends: 38 [2024-10-24 22:05:20,522 INFO L226 Difference]: Without dead ends: 27 [2024-10-24 22:05:20,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:20,523 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:20,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:20,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-24 22:05:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-10-24 22:05:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 22 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-24 22:05:20,528 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 12 [2024-10-24 22:05:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:20,528 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-24 22:05:20,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-24 22:05:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 22:05:20,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:20,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:20,539 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-10-24 22:05:20,729 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-10-24 22:05:20,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:20,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash -562031230, now seen corresponding path program 1 times [2024-10-24 22:05:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:20,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948327881] [2024-10-24 22:05:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:20,731 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-10-24 22:05:20,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:20,736 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-10-24 22:05:20,738 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-10-24 22:05:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:20,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 22:05:20,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:05:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:20,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:05:20,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:05:20,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948327881] [2024-10-24 22:05:20,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948327881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:20,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:20,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 22:05:20,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291086857] [2024-10-24 22:05:20,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:20,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 22:05:20,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:05:20,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 22:05:20,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 22:05:20,835 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:20,870 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-10-24 22:05:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 22:05:20,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-24 22:05:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:20,872 INFO L225 Difference]: With dead ends: 30 [2024-10-24 22:05:20,872 INFO L226 Difference]: Without dead ends: 29 [2024-10-24 22:05:20,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-10-24 22:05:20,874 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:20,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-24 22:05:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-24 22:05:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.391304347826087) internal successors, (32), 26 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-10-24 22:05:20,880 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 12 [2024-10-24 22:05:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:20,881 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-10-24 22:05:20,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-10-24 22:05:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 22:05:20,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:20,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:20,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 22:05:21,082 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-10-24 22:05:21,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -404812776, now seen corresponding path program 1 times [2024-10-24 22:05:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320735284] [2024-10-24 22:05:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:21,084 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-10-24 22:05:21,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:21,085 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-24 22:05:21,086 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 (5)] Waiting until timeout for monitored process [2024-10-24 22:05:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:21,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 22:05:21,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:05:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 22:05:21,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 22:05:21,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:05:21,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320735284] [2024-10-24 22:05:21,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320735284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 22:05:21,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 22:05:21,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 22:05:21,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873316516] [2024-10-24 22:05:21,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 22:05:21,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 22:05:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:05:21,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 22:05:21,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:21,162 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:21,193 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-10-24 22:05:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 22:05:21,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-24 22:05:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:21,194 INFO L225 Difference]: With dead ends: 44 [2024-10-24 22:05:21,194 INFO L226 Difference]: Without dead ends: 34 [2024-10-24 22:05:21,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 22:05:21,196 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:21,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-24 22:05:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-10-24 22:05:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-24 22:05:21,205 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 17 [2024-10-24 22:05:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:21,205 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-24 22:05:21,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:21,206 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-24 22:05:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 22:05:21,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:21,207 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:21,212 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 (5)] Ended with exit code 0 [2024-10-24 22:05:21,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-10-24 22:05:21,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:21,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash -403350678, now seen corresponding path program 1 times [2024-10-24 22:05:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:21,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071161285] [2024-10-24 22:05:21,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:21,413 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-10-24 22:05:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:21,416 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-24 22:05:21,417 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 (6)] Waiting until timeout for monitored process [2024-10-24 22:05:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 22:05:21,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 22:05:21,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 22:05:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:21,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 22:05:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 22:05:21,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 22:05:21,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071161285] [2024-10-24 22:05:21,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071161285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 22:05:21,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 22:05:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 22:05:21,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920208902] [2024-10-24 22:05:21,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 22:05:21,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 22:05:21,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 22:05:21,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 22:05:21,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 22:05:21,649 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 22:05:21,693 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-10-24 22:05:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 22:05:21,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-24 22:05:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 22:05:21,695 INFO L225 Difference]: With dead ends: 49 [2024-10-24 22:05:21,695 INFO L226 Difference]: Without dead ends: 28 [2024-10-24 22:05:21,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 22:05:21,697 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 22:05:21,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 22:05:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-24 22:05:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-24 22:05:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-24 22:05:21,702 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2024-10-24 22:05:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 22:05:21,702 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-24 22:05:21,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 22:05:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-24 22:05:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 22:05:21,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 22:05:21,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 22:05:21,709 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 (6)] Ended with exit code 0 [2024-10-24 22:05:21,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10-24 22:05:21,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-24 22:05:21,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 22:05:21,905 INFO L85 PathProgramCache]: Analyzing trace with hash 335705914, now seen corresponding path program 1 times [2024-10-24 22:05:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 22:05:21,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23209301] [2024-10-24 22:05:21,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 22:05:21,906 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-10-24 22:05:21,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 22:05:21,909 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-24 22:05:21,911 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 (7)] Waiting until timeout for monitored process [2024-10-24 22:05:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:21,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 22:05:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 22:05:22,012 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 22:05:22,012 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 22:05:22,013 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-24 22:05:22,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-24 22:05:22,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-24 22:05:22,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-24 22:05:22,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-24 22:05:22,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-24 22:05:22,024 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 22:05:22,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10-24 22:05:22,222 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 22:05:22,245 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 22:05:22,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:05:22 BoogieIcfgContainer [2024-10-24 22:05:22,248 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 22:05:22,248 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 22:05:22,248 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 22:05:22,249 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 22:05:22,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:05:19" (3/4) ... [2024-10-24 22:05:22,251 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 22:05:22,252 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 22:05:22,255 INFO L158 Benchmark]: Toolchain (without parser) took 4097.14ms. Allocated memory was 67.1MB in the beginning and 109.1MB in the end (delta: 41.9MB). Free memory was 33.8MB in the beginning and 57.4MB in the end (delta: -23.6MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-10-24 22:05:22,255 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 50.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:22,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1010.04ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 49.3MB in the end (delta: -15.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-10-24 22:05:22,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.16ms. Allocated memory is still 81.8MB. Free memory was 49.3MB in the beginning and 46.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:22,256 INFO L158 Benchmark]: Boogie Preprocessor took 67.42ms. Allocated memory is still 81.8MB. Free memory was 46.0MB in the beginning and 43.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:22,256 INFO L158 Benchmark]: RCFGBuilder took 476.14ms. Allocated memory is still 81.8MB. Free memory was 43.5MB in the beginning and 47.8MB in the end (delta: -4.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 22:05:22,257 INFO L158 Benchmark]: TraceAbstraction took 2458.92ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 46.8MB in the beginning and 57.4MB in the end (delta: -10.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-10-24 22:05:22,257 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 109.1MB. Free memory is still 57.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 22:05:22,259 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.21ms. Allocated memory is still 50.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1010.04ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 49.3MB in the end (delta: -15.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.16ms. Allocated memory is still 81.8MB. Free memory was 49.3MB in the beginning and 46.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.42ms. Allocated memory is still 81.8MB. Free memory was 46.0MB in the beginning and 43.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 476.14ms. Allocated memory is still 81.8MB. Free memory was 43.5MB in the beginning and 47.8MB in the end (delta: -4.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2458.92ms. Allocated memory was 81.8MB in the beginning and 109.1MB in the end (delta: 27.3MB). Free memory was 46.8MB in the beginning and 57.4MB in the end (delta: -10.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 109.1MB. Free memory is still 57.4MB. 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: 1561]: 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 1569. 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); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] 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] [L1570] CALL CWE190_Integer_Overflow__int_rand_multiply_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1559] COND TRUE data > 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=1073741824, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1561] data * 2 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 271 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 121 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=4, InterpolantAutomatonStates: 17, 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, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 9/11 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-10-24 22:05:22,287 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