./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_17_bad.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_17_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 402113d6bd7ef22d6f703ec6ce14c7dc47fd902133449d2309d9cbe9b8ce2bae --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 14:56:11,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 14:56:11,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 14:56:11,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 14:56:11,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 14:56:11,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 14:56:11,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 14:56:11,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 14:56:11,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 14:56:11,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 14:56:11,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 14:56:11,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 14:56:11,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 14:56:11,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 14:56:11,726 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 14:56:11,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 14:56:11,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 14:56:11,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 14:56:11,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 14:56:11,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 14:56:11,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 14:56:11,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 14:56:11,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 14:56:11,730 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 14:56:11,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 14:56:11,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 14:56:11,731 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 14:56:11,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 14:56:11,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 14:56:11,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 14:56:11,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 14:56:11,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:56:11,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 14:56:11,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 14:56:11,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 14:56:11,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 14:56:11,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 14:56:11,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 14:56:11,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 14:56:11,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 14:56:11,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 14:56:11,736 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 -> 402113d6bd7ef22d6f703ec6ce14c7dc47fd902133449d2309d9cbe9b8ce2bae [2024-10-13 14:56:12,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 14:56:12,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 14:56:12,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 14:56:12,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 14:56:12,054 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 14:56:12,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_17_bad.i [2024-10-13 14:56:13,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 14:56:13,884 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 14:56:13,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_17_bad.i [2024-10-13 14:56:13,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886f0b6a2/98340a26fda74e6d84abf08aef8a7a91/FLAG5e003e7c0 [2024-10-13 14:56:14,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886f0b6a2/98340a26fda74e6d84abf08aef8a7a91 [2024-10-13 14:56:14,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 14:56:14,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 14:56:14,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 14:56:14,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 14:56:14,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 14:56:14,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:56:14" (1/1) ... [2024-10-13 14:56:14,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b2e569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:14, skipping insertion in model container [2024-10-13 14:56:14,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:56:14" (1/1) ... [2024-10-13 14:56:14,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 14:56:15,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:56:15,051 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 14:56:15,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:56:15,255 INFO L204 MainTranslator]: Completed translation [2024-10-13 14:56:15,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15 WrapperNode [2024-10-13 14:56:15,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 14:56:15,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 14:56:15,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 14:56:15,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 14:56:15,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,313 INFO L138 Inliner]: procedures = 497, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2024-10-13 14:56:15,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 14:56:15,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 14:56:15,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 14:56:15,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 14:56:15,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,337 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 14:56:15,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 14:56:15,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 14:56:15,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 14:56:15,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 14:56:15,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (1/1) ... [2024-10-13 14:56:15,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:56:15,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 14:56:15,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 14:56:15,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 14:56:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 14:56:15,456 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 14:56:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 14:56:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 14:56:15,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 14:56:15,613 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 14:56:15,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 14:56:15,743 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-13 14:56:15,743 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 14:56:15,792 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 14:56:15,792 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 14:56:15,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:15 BoogieIcfgContainer [2024-10-13 14:56:15,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 14:56:15,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 14:56:15,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 14:56:15,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 14:56:15,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:56:14" (1/3) ... [2024-10-13 14:56:15,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e563f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:56:15, skipping insertion in model container [2024-10-13 14:56:15,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:15" (2/3) ... [2024-10-13 14:56:15,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e563f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:56:15, skipping insertion in model container [2024-10-13 14:56:15,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:15" (3/3) ... [2024-10-13 14:56:15,802 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_17_bad.i [2024-10-13 14:56:15,822 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 14:56:15,822 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 14:56:15,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 14:56:15,892 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;@751db4aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 14:56:15,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 14:56:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 14:56:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 14:56:15,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:15,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:15,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:56:15,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash -133348598, now seen corresponding path program 1 times [2024-10-13 14:56:15,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236700520] [2024-10-13 14:56:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:15,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:56:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:16,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236700520] [2024-10-13 14:56:16,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236700520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:16,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:16,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690827333] [2024-10-13 14:56:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:16,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:16,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:16,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:16,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:16,416 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:16,480 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-10-13 14:56:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:16,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2024-10-13 14:56:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:16,491 INFO L225 Difference]: With dead ends: 49 [2024-10-13 14:56:16,491 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 14:56:16,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:16,501 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:16,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 14:56:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-13 14:56:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 22 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-10-13 14:56:16,532 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 9 [2024-10-13 14:56:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:16,532 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-13 14:56:16,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-10-13 14:56:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 14:56:16,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:16,534 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:16,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 14:56:16,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:56:16,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash 256722690, now seen corresponding path program 1 times [2024-10-13 14:56:16,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:16,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518102050] [2024-10-13 14:56:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:16,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:56:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518102050] [2024-10-13 14:56:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518102050] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 14:56:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593972249] [2024-10-13 14:56:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:16,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 14:56:16,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 14:56:16,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 14:56:16,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 14:56:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:16,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 14:56:16,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 14:56:16,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:56:16,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 14:56:16,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593972249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:16,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 14:56:16,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-13 14:56:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732522231] [2024-10-13 14:56:16,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:16,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 14:56:16,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 14:56:16,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 14:56:16,827 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:16,856 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-10-13 14:56:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 14:56:16,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-13 14:56:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:16,858 INFO L225 Difference]: With dead ends: 36 [2024-10-13 14:56:16,858 INFO L226 Difference]: Without dead ends: 21 [2024-10-13 14:56:16,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 14:56:16,859 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:16,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-13 14:56:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-13 14:56:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-13 14:56:16,868 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2024-10-13 14:56:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:16,869 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-13 14:56:16,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-13 14:56:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 14:56:16,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:16,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:16,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 14:56:17,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 14:56:17,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:56:17,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1895887612, now seen corresponding path program 1 times [2024-10-13 14:56:17,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:17,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465723758] [2024-10-13 14:56:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:17,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 14:56:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:56:17,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 14:56:17,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465723758] [2024-10-13 14:56:17,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465723758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:17,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:17,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415566903] [2024-10-13 14:56:17,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:17,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 14:56:17,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:17,176 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-10-13 14:56:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:17,209 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-13 14:56:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:17,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-13 14:56:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:17,211 INFO L225 Difference]: With dead ends: 21 [2024-10-13 14:56:17,211 INFO L226 Difference]: Without dead ends: 20 [2024-10-13 14:56:17,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:17,212 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:17,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-13 14:56:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-13 14:56:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-13 14:56:17,220 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2024-10-13 14:56:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:17,220 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-13 14:56:17,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-13 14:56:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 14:56:17,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:17,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:17,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 14:56:17,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:56:17,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1357026100, now seen corresponding path program 1 times [2024-10-13 14:56:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 14:56:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720565186] [2024-10-13 14:56:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:17,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 14:56:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 14:56:17,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 14:56:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 14:56:17,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 14:56:17,282 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 14:56:17,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-13 14:56:17,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-13 14:56:17,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-13 14:56:17,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-13 14:56:17,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-13 14:56:17,289 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-13 14:56:17,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 14:56:17,294 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 14:56:17,316 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 14:56:17,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:56:17 BoogieIcfgContainer [2024-10-13 14:56:17,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 14:56:17,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 14:56:17,320 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 14:56:17,320 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 14:56:17,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:15" (3/4) ... [2024-10-13 14:56:17,324 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 14:56:17,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 14:56:17,326 INFO L158 Benchmark]: Toolchain (without parser) took 3190.40ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 68.5MB in the beginning and 90.3MB in the end (delta: -21.8MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2024-10-13 14:56:17,327 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 127.9MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:56:17,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1118.63ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 68.3MB in the beginning and 107.3MB in the end (delta: -39.0MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-10-13 14:56:17,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.41ms. Allocated memory is still 184.5MB. Free memory was 106.4MB in the beginning and 104.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:56:17,327 INFO L158 Benchmark]: Boogie Preprocessor took 40.15ms. Allocated memory is still 184.5MB. Free memory was 104.3MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:56:17,328 INFO L158 Benchmark]: RCFGBuilder took 438.39ms. Allocated memory is still 184.5MB. Free memory was 102.1MB in the beginning and 87.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 14:56:17,328 INFO L158 Benchmark]: TraceAbstraction took 1524.41ms. Allocated memory is still 184.5MB. Free memory was 86.4MB in the beginning and 90.3MB in the end (delta: -4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:56:17,328 INFO L158 Benchmark]: Witness Printer took 5.87ms. Allocated memory is still 184.5MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:56:17,333 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 127.9MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1118.63ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 68.3MB in the beginning and 107.3MB in the end (delta: -39.0MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.41ms. Allocated memory is still 184.5MB. Free memory was 106.4MB in the beginning and 104.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.15ms. Allocated memory is still 184.5MB. Free memory was 104.3MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.39ms. Allocated memory is still 184.5MB. Free memory was 102.1MB in the beginning and 87.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1524.41ms. Allocated memory is still 184.5MB. Free memory was 86.4MB in the beginning and 90.3MB in the end (delta: -4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.87ms. Allocated memory is still 184.5MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_fscanf_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 [L1560] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 54 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 4/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 14:56:17,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_17_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 402113d6bd7ef22d6f703ec6ce14c7dc47fd902133449d2309d9cbe9b8ce2bae --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 14:56:19,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 14:56:19,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-13 14:56:19,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 14:56:19,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 14:56:19,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-13 14:56:19,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 14:56:19,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 14:56:19,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 14:56:19,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 14:56:19,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 14:56:19,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 14:56:19,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 14:56:19,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 14:56:19,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 14:56:19,756 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 14:56:19,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 14:56:19,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 14:56:19,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 14:56:19,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 14:56:19,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 14:56:19,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 14:56:19,762 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 14:56:19,762 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 14:56:19,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 14:56:19,763 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 14:56:19,763 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 14:56:19,764 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 14:56:19,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 14:56:19,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 14:56:19,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 14:56:19,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 14:56:19,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 14:56:19,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 14:56:19,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:56:19,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 14:56:19,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 14:56:19,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 14:56:19,776 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 14:56:19,776 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 14:56:19,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 14:56:19,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 14:56:19,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 14:56:19,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 14:56:19,777 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 14:56:19,778 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 -> 402113d6bd7ef22d6f703ec6ce14c7dc47fd902133449d2309d9cbe9b8ce2bae [2024-10-13 14:56:20,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 14:56:20,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 14:56:20,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 14:56:20,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 14:56:20,112 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 14:56:20,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_17_bad.i [2024-10-13 14:56:21,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 14:56:22,167 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 14:56:22,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_17_bad.i [2024-10-13 14:56:22,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f698e2a/78c08e4f0f4e429ea4d270ff4ad7da77/FLAG9100186dd [2024-10-13 14:56:22,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f698e2a/78c08e4f0f4e429ea4d270ff4ad7da77 [2024-10-13 14:56:22,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 14:56:22,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 14:56:22,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 14:56:22,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 14:56:22,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 14:56:22,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:56:22" (1/1) ... [2024-10-13 14:56:22,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7dd33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:22, skipping insertion in model container [2024-10-13 14:56:22,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:56:22" (1/1) ... [2024-10-13 14:56:22,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 14:56:22,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:56:22,969 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 14:56:23,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 14:56:23,163 INFO L204 MainTranslator]: Completed translation [2024-10-13 14:56:23,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23 WrapperNode [2024-10-13 14:56:23,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 14:56:23,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 14:56:23,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 14:56:23,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 14:56:23,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,229 INFO L138 Inliner]: procedures = 502, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2024-10-13 14:56:23,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 14:56:23,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 14:56:23,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 14:56:23,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 14:56:23,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,277 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 14:56:23,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 14:56:23,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 14:56:23,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 14:56:23,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 14:56:23,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (1/1) ... [2024-10-13 14:56:23,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 14:56:23,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 14:56:23,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 14:56:23,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 14:56:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 14:56:23,410 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 14:56:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 14:56:23,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 14:56:23,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 14:56:23,568 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 14:56:23,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 14:56:23,759 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 14:56:23,759 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 14:56:23,792 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 14:56:23,793 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 14:56:23,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:23 BoogieIcfgContainer [2024-10-13 14:56:23,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 14:56:23,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 14:56:23,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 14:56:23,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 14:56:23,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:56:22" (1/3) ... [2024-10-13 14:56:23,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681c3f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:56:23, skipping insertion in model container [2024-10-13 14:56:23,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:56:23" (2/3) ... [2024-10-13 14:56:23,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681c3f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:56:23, skipping insertion in model container [2024-10-13 14:56:23,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:23" (3/3) ... [2024-10-13 14:56:23,803 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_17_bad.i [2024-10-13 14:56:23,822 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 14:56:23,823 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 14:56:23,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 14:56:23,901 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;@35602479, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 14:56:23,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 14:56:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 14:56:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 14:56:23,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:23,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:23,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:56:23,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash -133348598, now seen corresponding path program 1 times [2024-10-13 14:56:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 14:56:23,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61481746] [2024-10-13 14:56:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:23,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:56:23,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 14:56:23,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 14:56:23,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 14:56:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:24,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 14:56:24,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 14:56:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:56:24,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 14:56:24,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 14:56:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61481746] [2024-10-13 14:56:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61481746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 14:56:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477568002] [2024-10-13 14:56:24,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:24,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 14:56:24,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 14:56:24,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 14:56:24,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 14:56:24,098 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:24,132 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-13 14:56:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 14:56:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 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 9 [2024-10-13 14:56:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:24,140 INFO L225 Difference]: With dead ends: 42 [2024-10-13 14:56:24,140 INFO L226 Difference]: Without dead ends: 19 [2024-10-13 14:56:24,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 14:56:24,146 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:24,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-13 14:56:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-13 14:56:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-13 14:56:24,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2024-10-13 14:56:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:24,177 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-13 14:56:24,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-13 14:56:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 14:56:24,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:24,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:24,183 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-10-13 14:56:24,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:56:24,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:56:24,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash 161160814, now seen corresponding path program 1 times [2024-10-13 14:56:24,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 14:56:24,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255947362] [2024-10-13 14:56:24,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:24,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:56:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 14:56:24,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 14:56:24,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 14:56:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:24,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 14:56:24,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 14:56:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:56:24,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 14:56:24,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 14:56:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255947362] [2024-10-13 14:56:24,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255947362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 14:56:24,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 14:56:24,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 14:56:24,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347021810] [2024-10-13 14:56:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 14:56:24,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 14:56:24,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 14:56:24,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 14:56:24,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:24,523 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:24,554 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-10-13 14:56:24,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 14:56:24,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-13 14:56:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:24,563 INFO L225 Difference]: With dead ends: 31 [2024-10-13 14:56:24,563 INFO L226 Difference]: Without dead ends: 22 [2024-10-13 14:56:24,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 14:56:24,565 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:24,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-13 14:56:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-13 14:56:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-13 14:56:24,576 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2024-10-13 14:56:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:24,576 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-13 14:56:24,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-13 14:56:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 14:56:24,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:24,580 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:24,584 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 14:56:24,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:56:24,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:56:24,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:24,781 INFO L85 PathProgramCache]: Analyzing trace with hash -631531146, now seen corresponding path program 1 times [2024-10-13 14:56:24,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 14:56:24,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146200305] [2024-10-13 14:56:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:24,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:56:24,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 14:56:24,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 14:56:24,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 14:56:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 14:56:24,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 14:56:24,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 14:56:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:56:24,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 14:56:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 14:56:24,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 14:56:24,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146200305] [2024-10-13 14:56:24,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146200305] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 14:56:24,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 14:56:24,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 14:56:24,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090009329] [2024-10-13 14:56:24,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 14:56:24,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 14:56:24,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 14:56:24,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 14:56:24,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 14:56:24,939 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-10-13 14:56:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 14:56:24,986 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-10-13 14:56:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 14:56:24,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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 13 [2024-10-13 14:56:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 14:56:24,988 INFO L225 Difference]: With dead ends: 31 [2024-10-13 14:56:24,988 INFO L226 Difference]: Without dead ends: 19 [2024-10-13 14:56:24,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 14:56:24,990 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 14:56:24,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 14:56:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-13 14:56:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-13 14:56:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 14:56:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-10-13 14:56:24,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2024-10-13 14:56:24,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 14:56:24,995 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-13 14:56:24,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-10-13 14:56:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-10-13 14:56:24,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 14:56:24,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 14:56:24,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 14:56:25,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 14:56:25,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:56:25,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 14:56:25,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 14:56:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1357026100, now seen corresponding path program 1 times [2024-10-13 14:56:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 14:56:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613976049] [2024-10-13 14:56:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 14:56:25,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:56:25,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 14:56:25,202 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 14:56:25,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 14:56:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 14:56:25,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 14:56:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 14:56:25,302 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 14:56:25,302 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 14:56:25,303 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-13 14:56:25,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-13 14:56:25,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-13 14:56:25,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-13 14:56:25,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-13 14:56:25,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-13 14:56:25,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 14:56:25,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 14:56:25,509 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 14:56:25,549 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 14:56:25,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:56:25 BoogieIcfgContainer [2024-10-13 14:56:25,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 14:56:25,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 14:56:25,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 14:56:25,559 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 14:56:25,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:56:23" (3/4) ... [2024-10-13 14:56:25,561 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 14:56:25,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 14:56:25,571 INFO L158 Benchmark]: Toolchain (without parser) took 3345.98ms. Allocated memory was 62.9MB in the beginning and 130.0MB in the end (delta: 67.1MB). Free memory was 41.2MB in the beginning and 100.7MB in the end (delta: -59.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-10-13 14:56:25,572 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 37.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:56:25,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 939.08ms. Allocated memory was 62.9MB in the beginning and 104.9MB in the end (delta: 41.9MB). Free memory was 41.0MB in the beginning and 63.6MB in the end (delta: -22.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-10-13 14:56:25,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.88ms. Allocated memory is still 104.9MB. Free memory was 63.6MB in the beginning and 60.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 14:56:25,578 INFO L158 Benchmark]: Boogie Preprocessor took 86.50ms. Allocated memory is still 104.9MB. Free memory was 60.5MB in the beginning and 57.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 14:56:25,579 INFO L158 Benchmark]: RCFGBuilder took 474.68ms. Allocated memory is still 104.9MB. Free memory was 57.8MB in the beginning and 72.7MB in the end (delta: -14.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-10-13 14:56:25,579 INFO L158 Benchmark]: TraceAbstraction took 1763.33ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 71.6MB in the beginning and 100.7MB in the end (delta: -29.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-10-13 14:56:25,580 INFO L158 Benchmark]: Witness Printer took 8.21ms. Allocated memory is still 130.0MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 14:56:25,597 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 37.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 939.08ms. Allocated memory was 62.9MB in the beginning and 104.9MB in the end (delta: 41.9MB). Free memory was 41.0MB in the beginning and 63.6MB in the end (delta: -22.6MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.88ms. Allocated memory is still 104.9MB. Free memory was 63.6MB in the beginning and 60.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.50ms. Allocated memory is still 104.9MB. Free memory was 60.5MB in the beginning and 57.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 474.68ms. Allocated memory is still 104.9MB. Free memory was 57.8MB in the beginning and 72.7MB in the end (delta: -14.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1763.33ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 71.6MB in the beginning and 100.7MB in the end (delta: -29.1MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 8.21ms. Allocated memory is still 130.0MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 1569. Possible FailurePath: [L1522] const int GLOBAL_CONST_TRUE = 1; [L1523] const int GLOBAL_CONST_FALSE = 0; [L1524] const int GLOBAL_CONST_FIVE = 5; [L1525] int globalTrue = 1; [L1526] int globalFalse = 0; [L1527] int globalFive = 5; [L1546] int globalArgc = 0; [L1547] char** globalArgv = ((void *)0); [L1569] CALL printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, \old(line)={1:0}, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1414] COND TRUE line != ((void *)0) [L1569] RET printLine("Calling bad()...") VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1570] CALL CWE190_Integer_Overflow__int_fscanf_postinc_17_bad() [L1550] int i,j; [L1551] int data; [L1552] data = 0 [L1553] i = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=0, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=0] [L1553] COND TRUE i < 1 [L1553] i++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, i=1] [L1553] COND FALSE !(i < 1) VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1] [L1557] j = 0 VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, data=2147483647, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] [L1557] COND TRUE j < 1 [L1560] data++ VAL [GLOBAL_CONST_FALSE=0, GLOBAL_CONST_FIVE=5, GLOBAL_CONST_TRUE=1, globalArgc=0, globalArgv={0:0}, globalFalse=0, globalFive=5, globalTrue=1, j=0] - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1553]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1560]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1557]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 145 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 52 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 73 SizeOfPredicates, 0 NumberOfNonLiveVariables, 121 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 14:56:25,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample