./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_15_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_15_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dff7a34f126cebfd70209ee3091c1d26d4a312400d5536a6607b8d06fec542a2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:15:33,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:15:33,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-12 19:15:33,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:15:33,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:15:33,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:15:33,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:15:33,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:15:33,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:15:33,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:15:33,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:15:33,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:15:33,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:15:33,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:15:33,482 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:15:33,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:15:33,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:15:33,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 19:15:33,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:15:33,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:15:33,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:15:33,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:15:33,484 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:15:33,486 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:15:33,486 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:15:33,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:15:33,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:15:33,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:15:33,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:15:33,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:15:33,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:15:33,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:15:33,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:15:33,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:15:33,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:15:33,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 19:15:33,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 19:15:33,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:15:33,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:15:33,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:15:33,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:15:33,490 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dff7a34f126cebfd70209ee3091c1d26d4a312400d5536a6607b8d06fec542a2 [2024-11-12 19:15:33,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:15:33,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:15:33,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:15:33,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:15:33,777 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:15:33,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-12 19:15:35,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:15:35,318 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:15:35,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-12 19:15:35,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccbacf9d/b0da306704d14f2b93633b7a5e88e253/FLAGdce550f22 [2024-11-12 19:15:35,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dccbacf9d/b0da306704d14f2b93633b7a5e88e253 [2024-11-12 19:15:35,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:15:35,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:15:35,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:15:35,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:15:35,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:15:35,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:35" (1/1) ... [2024-11-12 19:15:35,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e5fc57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:35, skipping insertion in model container [2024-11-12 19:15:35,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:35" (1/1) ... [2024-11-12 19:15:35,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:15:36,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:15:36,020 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:15:36,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:15:36,144 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:15:36,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36 WrapperNode [2024-11-12 19:15:36,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:15:36,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:15:36,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:15:36,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:15:36,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,194 INFO L138 Inliner]: procedures = 497, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2024-11-12 19:15:36,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:15:36,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:15:36,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:15:36,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:15:36,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,220 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 19:15:36,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:15:36,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:15:36,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:15:36,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:15:36,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (1/1) ... [2024-11-12 19:15:36,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:15:36,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:15:36,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 19:15:36,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 19:15:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:15:36,336 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:15:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:15:36,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:15:36,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:15:36,501 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:15:36,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:15:36,676 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-12 19:15:36,676 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:15:36,684 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:15:36,684 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 19:15:36,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:36 BoogieIcfgContainer [2024-11-12 19:15:36,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:15:36,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:15:36,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:15:36,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:15:36,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:15:35" (1/3) ... [2024-11-12 19:15:36,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191b4d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:36, skipping insertion in model container [2024-11-12 19:15:36,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:36" (2/3) ... [2024-11-12 19:15:36,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191b4d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:36, skipping insertion in model container [2024-11-12 19:15:36,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:36" (3/3) ... [2024-11-12 19:15:36,695 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-12 19:15:36,708 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:15:36,709 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 19:15:36,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:15:36,770 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;@3a6cb3a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:15:36,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 19:15:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 45 states have internal predecessors, (61), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 19:15:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 19:15:36,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:36,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:36,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:36,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash -930289097, now seen corresponding path program 1 times [2024-11-12 19:15:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:15:36,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915507792] [2024-11-12 19:15:36,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:15:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:15:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:15:36,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:15:36,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915507792] [2024-11-12 19:15:36,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915507792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:36,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:36,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 19:15:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507439869] [2024-11-12 19:15:36,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:36,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:15:36,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:15:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:15:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:37,003 INFO L87 Difference]: Start difference. First operand has 49 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 45 states have internal predecessors, (61), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:37,022 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-12 19:15:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:15:37,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-12 19:15:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:37,029 INFO L225 Difference]: With dead ends: 69 [2024-11-12 19:15:37,029 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 19:15:37,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:37,033 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:15:37,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 19:15:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 19:15:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 19:15:37,057 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 13 [2024-11-12 19:15:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:37,058 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 19:15:37,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 19:15:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 19:15:37,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:37,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:37,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 19:15:37,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:37,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:37,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1666609480, now seen corresponding path program 1 times [2024-11-12 19:15:37,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:15:37,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72896866] [2024-11-12 19:15:37,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:37,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:15:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:15:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:15:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:15:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72896866] [2024-11-12 19:15:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72896866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:37,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 19:15:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74925117] [2024-11-12 19:15:37,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:37,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 19:15:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:15:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 19:15:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 19:15:37,324 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:37,410 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-11-12 19:15:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 19:15:37,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-12 19:15:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:37,412 INFO L225 Difference]: With dead ends: 44 [2024-11-12 19:15:37,412 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 19:15:37,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 19:15:37,414 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 40 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:15:37,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 161 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 19:15:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-12 19:15:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2024-11-12 19:15:37,420 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18 [2024-11-12 19:15:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:37,421 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2024-11-12 19:15:37,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2024-11-12 19:15:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 19:15:37,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:37,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:37,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 19:15:37,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:37,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:37,424 INFO L85 PathProgramCache]: Analyzing trace with hash 660283998, now seen corresponding path program 1 times [2024-11-12 19:15:37,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:15:37,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427058467] [2024-11-12 19:15:37,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:15:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:37,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 19:15:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:15:37,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 19:15:37,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427058467] [2024-11-12 19:15:37,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427058467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:37,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:37,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 19:15:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89679624] [2024-11-12 19:15:37,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:37,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:15:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 19:15:37,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:15:37,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:37,537 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:37,545 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-12 19:15:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:15:37,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-12 19:15:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:37,546 INFO L225 Difference]: With dead ends: 42 [2024-11-12 19:15:37,547 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 19:15:37,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:37,548 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:15:37,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 55 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:37,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 19:15:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2024-11-12 19:15:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 19:15:37,552 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 18 [2024-11-12 19:15:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:37,552 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 19:15:37,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 19:15:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 19:15:37,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:37,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:37,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 19:15:37,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:37,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:37,554 INFO L85 PathProgramCache]: Analyzing trace with hash -125286187, now seen corresponding path program 1 times [2024-11-12 19:15:37,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 19:15:37,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60783887] [2024-11-12 19:15:37,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:37,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 19:15:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:15:37,571 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:15:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:15:37,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 19:15:37,596 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:15:37,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 19:15:37,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 19:15:37,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 19:15:37,601 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 19:15:37,647 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:15:37,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:15:37 BoogieIcfgContainer [2024-11-12 19:15:37,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:15:37,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:15:37,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:15:37,654 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:15:37,655 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:36" (3/4) ... [2024-11-12 19:15:37,657 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:15:37,658 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:15:37,659 INFO L158 Benchmark]: Toolchain (without parser) took 2280.49ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 152.7MB in the beginning and 216.4MB in the end (delta: -63.7MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-11-12 19:15:37,659 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:15:37,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 764.58ms. Allocated memory is still 184.5MB. Free memory was 152.5MB in the beginning and 91.3MB in the end (delta: 61.2MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2024-11-12 19:15:37,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.16ms. Allocated memory is still 184.5MB. Free memory was 91.0MB in the beginning and 88.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 19:15:37,660 INFO L158 Benchmark]: Boogie Preprocessor took 40.06ms. Allocated memory is still 184.5MB. Free memory was 88.0MB in the beginning and 85.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:15:37,661 INFO L158 Benchmark]: RCFGBuilder took 449.10ms. Allocated memory is still 184.5MB. Free memory was 85.0MB in the beginning and 137.0MB in the end (delta: -52.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 19:15:37,661 INFO L158 Benchmark]: TraceAbstraction took 963.99ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 137.0MB in the beginning and 216.4MB in the end (delta: -79.4MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2024-11-12 19:15:37,661 INFO L158 Benchmark]: Witness Printer took 8.19ms. Allocated memory is still 251.7MB. Free memory was 216.4MB in the beginning and 216.4MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:15:37,663 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.14ms. Allocated memory is still 184.5MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 764.58ms. Allocated memory is still 184.5MB. Free memory was 152.5MB in the beginning and 91.3MB in the end (delta: 61.2MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.16ms. Allocated memory is still 184.5MB. Free memory was 91.0MB in the beginning and 88.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.06ms. Allocated memory is still 184.5MB. Free memory was 88.0MB in the beginning and 85.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.10ms. Allocated memory is still 184.5MB. Free memory was 85.0MB in the beginning and 137.0MB in the end (delta: -52.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 963.99ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 137.0MB in the beginning and 216.4MB in the end (delta: -79.4MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. * Witness Printer took 8.19ms. Allocated memory is still 251.7MB. Free memory was 216.4MB in the beginning and 216.4MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1565]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1578. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL CWE190_Integer_Overflow__int_rand_preinc_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: [L1554] case 6: [L1554] case 6: [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1554] case 6: [L1555] EXPR ((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand() VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1563] case 7: VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1565] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1565]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 339 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 189 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 150 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 19:15:37,735 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_15_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash dff7a34f126cebfd70209ee3091c1d26d4a312400d5536a6607b8d06fec542a2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 19:15:39,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 19:15:39,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-11-12 19:15:39,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 19:15:39,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 19:15:39,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-11-12 19:15:39,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 19:15:39,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 19:15:39,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 19:15:39,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 19:15:39,828 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 19:15:39,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 19:15:39,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 19:15:39,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 19:15:39,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 19:15:39,830 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 19:15:39,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 19:15:39,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 19:15:39,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 19:15:39,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 19:15:39,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 19:15:39,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 19:15:39,834 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 19:15:39,836 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 19:15:39,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 19:15:39,836 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 19:15:39,837 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 19:15:39,837 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 19:15:39,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 19:15:39,837 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 19:15:39,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 19:15:39,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 19:15:39,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 19:15:39,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 19:15:39,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:15:39,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 19:15:39,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 19:15:39,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 19:15:39,839 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 19:15:39,839 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 19:15:39,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 19:15:39,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 19:15:39,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 19:15:39,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 19:15:39,843 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dff7a34f126cebfd70209ee3091c1d26d4a312400d5536a6607b8d06fec542a2 [2024-11-12 19:15:40,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 19:15:40,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 19:15:40,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 19:15:40,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 19:15:40,145 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 19:15:40,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-12 19:15:41,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 19:15:41,819 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 19:15:41,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-12 19:15:41,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2c1cc95/846b7dcbdc9e46e7a26ed1bc7ed13dd2/FLAG8110b136e [2024-11-12 19:15:42,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2c1cc95/846b7dcbdc9e46e7a26ed1bc7ed13dd2 [2024-11-12 19:15:42,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 19:15:42,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 19:15:42,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 19:15:42,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 19:15:42,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 19:15:42,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:42,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6adbf848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42, skipping insertion in model container [2024-11-12 19:15:42,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:42,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 19:15:42,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:15:42,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 19:15:42,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 19:15:42,966 INFO L204 MainTranslator]: Completed translation [2024-11-12 19:15:42,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42 WrapperNode [2024-11-12 19:15:42,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 19:15:42,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 19:15:42,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 19:15:42,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 19:15:42,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,046 INFO L138 Inliner]: procedures = 502, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-11-12 19:15:43,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 19:15:43,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 19:15:43,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 19:15:43,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 19:15:43,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,069 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-12 19:15:43,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 19:15:43,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 19:15:43,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 19:15:43,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 19:15:43,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (1/1) ... [2024-11-12 19:15:43,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 19:15:43,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 19:15:43,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 19:15:43,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 19:15:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-11-12 19:15:43,158 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-11-12 19:15:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 19:15:43,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 19:15:43,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 19:15:43,271 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 19:15:43,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 19:15:43,391 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-12 19:15:43,391 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 19:15:43,403 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 19:15:43,403 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 19:15:43,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:43 BoogieIcfgContainer [2024-11-12 19:15:43,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 19:15:43,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 19:15:43,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 19:15:43,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 19:15:43,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:15:42" (1/3) ... [2024-11-12 19:15:43,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eabf6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:43, skipping insertion in model container [2024-11-12 19:15:43,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:42" (2/3) ... [2024-11-12 19:15:43,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23eabf6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:43, skipping insertion in model container [2024-11-12 19:15:43,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:43" (3/3) ... [2024-11-12 19:15:43,410 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_preinc_15_bad.i [2024-11-12 19:15:43,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 19:15:43,423 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 19:15:43,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 19:15:43,477 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;@1ce9e6a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 19:15:43,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 19:15:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 19:15:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 19:15:43,490 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:43,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:43,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:43,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:43,504 INFO L85 PathProgramCache]: Analyzing trace with hash 56724319, now seen corresponding path program 1 times [2024-11-12 19:15:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:15:43,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061883282] [2024-11-12 19:15:43,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:43,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:15:43,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:15:43,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 19:15:43,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 19:15:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:43,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 19:15:43,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:15:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:15:43,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:15:43,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:15:43,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061883282] [2024-11-12 19:15:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061883282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-12 19:15:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621085832] [2024-11-12 19:15:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:43,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 19:15:43,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:15:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 19:15:43,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 19:15:43,660 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:43,674 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-11-12 19:15:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 19:15:43,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-12 19:15:43,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:43,680 INFO L225 Difference]: With dead ends: 29 [2024-11-12 19:15:43,680 INFO L226 Difference]: Without dead ends: 18 [2024-11-12 19:15:43,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 19:15:43,686 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:15:43,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-12 19:15:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-12 19:15:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 19:15:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-12 19:15:43,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2024-11-12 19:15:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:43,716 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-12 19:15:43,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 11.0) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-12 19:15:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 19:15:43,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:43,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:43,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 19:15:43,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:15:43,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:43,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1758453958, now seen corresponding path program 1 times [2024-11-12 19:15:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:15:43,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827673060] [2024-11-12 19:15:43,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:43,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:15:43,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:15:43,929 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 19:15:43,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 19:15:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 19:15:44,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 19:15:44,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 19:15:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 19:15:44,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 19:15:44,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 19:15:44,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827673060] [2024-11-12 19:15:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827673060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 19:15:44,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 19:15:44,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 19:15:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402746911] [2024-11-12 19:15:44,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 19:15:44,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 19:15:44,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 19:15:44,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 19:15:44,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:44,036 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 19:15:44,045 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-12 19:15:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 19:15:44,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-12 19:15:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 19:15:44,047 INFO L225 Difference]: With dead ends: 27 [2024-11-12 19:15:44,047 INFO L226 Difference]: Without dead ends: 16 [2024-11-12 19:15:44,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 19:15:44,048 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 19:15:44,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 19:15:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-12 19:15:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-12 19:15:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-12 19:15:44,053 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2024-11-12 19:15:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 19:15:44,054 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-12 19:15:44,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 19:15:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-12 19:15:44,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 19:15:44,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 19:15:44,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 19:15:44,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 19:15:44,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:15:44,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-11-12 19:15:44,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 19:15:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1072976997, now seen corresponding path program 1 times [2024-11-12 19:15:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 19:15:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765891719] [2024-11-12 19:15:44,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 19:15:44,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:15:44,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 19:15:44,263 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 19:15:44,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 19:15:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:15:44,314 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 19:15:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 19:15:44,350 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-12 19:15:44,350 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 19:15:44,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2024-11-12 19:15:44,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2024-11-12 19:15:44,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 19:15:44,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 19:15:44,556 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 19:15:44,574 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 19:15:44,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:15:44 BoogieIcfgContainer [2024-11-12 19:15:44,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 19:15:44,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 19:15:44,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 19:15:44,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 19:15:44,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:43" (3/4) ... [2024-11-12 19:15:44,598 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 19:15:44,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 19:15:44,602 INFO L158 Benchmark]: Toolchain (without parser) took 2471.03ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 56.6MB in the beginning and 83.9MB in the end (delta: -27.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:15:44,603 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 60.8MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:15:44,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 835.09ms. Allocated memory is still 88.1MB. Free memory was 56.4MB in the beginning and 35.7MB in the end (delta: 20.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-12 19:15:44,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.48ms. Allocated memory is still 88.1MB. Free memory was 35.7MB in the beginning and 58.8MB in the end (delta: -23.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-12 19:15:44,604 INFO L158 Benchmark]: Boogie Preprocessor took 44.60ms. Allocated memory is still 88.1MB. Free memory was 58.8MB in the beginning and 56.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 19:15:44,604 INFO L158 Benchmark]: RCFGBuilder took 311.60ms. Allocated memory is still 88.1MB. Free memory was 56.3MB in the beginning and 41.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 19:15:44,607 INFO L158 Benchmark]: TraceAbstraction took 1185.27ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 40.4MB in the beginning and 83.9MB in the end (delta: -43.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-12 19:15:44,607 INFO L158 Benchmark]: Witness Printer took 11.36ms. Allocated memory is still 113.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 19:15:44,609 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.87ms. Allocated memory is still 60.8MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 835.09ms. Allocated memory is still 88.1MB. Free memory was 56.4MB in the beginning and 35.7MB in the end (delta: 20.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.48ms. Allocated memory is still 88.1MB. Free memory was 35.7MB in the beginning and 58.8MB in the end (delta: -23.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.60ms. Allocated memory is still 88.1MB. Free memory was 58.8MB in the beginning and 56.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 311.60ms. Allocated memory is still 88.1MB. Free memory was 56.3MB in the beginning and 41.1MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1185.27ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 40.4MB in the beginning and 83.9MB in the end (delta: -43.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Witness Printer took 11.36ms. Allocated memory is still 113.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1565]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1578. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1578] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={3:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1578] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1579] CALL CWE190_Integer_Overflow__int_rand_preinc_15_bad() [L1550] int data; [L1551] data = 0 [L1554] case 6: [L1554] case 6: [L1555] EXPR rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1555] data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1563] case 7: VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1565] ++data VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] - UnprovableResult [Line: 1565]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 52 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 91 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 19:15:44,690 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