./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b884f210784373b42c472a85a9cfd5963822e872cafb602d6bfc9ce286fa4e8a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:30:57,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:30:57,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:30:57,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:30:57,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:30:57,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:30:57,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:30:57,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:30:57,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:30:57,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:30:57,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:30:57,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:30:57,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:30:57,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:30:57,919 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:30:57,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:30:57,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:30:57,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:30:57,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:30:57,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:30:57,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:30:57,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:30:57,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:30:57,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:30:57,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:30:57,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:30:57,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:30:57,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:30:57,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:30:57,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:30:57,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:30:57,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:30:57,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:30:57,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:30:57,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:30:57,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:30:57,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:30:57,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:30:57,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:30:57,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:30:57,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:30:57,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:30:57,929 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b884f210784373b42c472a85a9cfd5963822e872cafb602d6bfc9ce286fa4e8a [2024-11-10 07:30:58,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:30:58,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:30:58,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:30:58,220 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:30:58,220 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:30:58,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i [2024-11-10 07:30:59,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:30:59,936 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:30:59,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i [2024-11-10 07:30:59,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64039c4c8/1bc8b7cbaa5948989e88a0e6d6a856da/FLAG5328b713c [2024-11-10 07:30:59,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64039c4c8/1bc8b7cbaa5948989e88a0e6d6a856da [2024-11-10 07:30:59,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:30:59,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:30:59,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:30:59,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:30:59,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:30:59,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:30:59" (1/1) ... [2024-11-10 07:30:59,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21745c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:30:59, skipping insertion in model container [2024-11-10 07:30:59,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:30:59" (1/1) ... [2024-11-10 07:31:00,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:31:00,199 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i[915,928] [2024-11-10 07:31:00,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:31:00,260 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:31:00,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i[915,928] [2024-11-10 07:31:00,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:31:00,304 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:31:00,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00 WrapperNode [2024-11-10 07:31:00,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:31:00,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:31:00,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:31:00,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:31:00,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,346 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-10 07:31:00,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:31:00,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:31:00,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:31:00,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:31:00,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,384 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:31:00,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:31:00,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:31:00,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:31:00,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:31:00,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (1/1) ... [2024-11-10 07:31:00,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:31:00,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:31:00,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:31:00,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:31:00,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:31:00,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:31:00,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:31:00,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:31:00,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:31:00,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:31:00,647 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:31:00,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:31:00,901 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 07:31:00,902 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:31:00,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:31:00,920 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:31:00,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:31:00 BoogieIcfgContainer [2024-11-10 07:31:00,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:31:00,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:31:00,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:31:00,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:31:00,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:30:59" (1/3) ... [2024-11-10 07:31:00,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726c3b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:31:00, skipping insertion in model container [2024-11-10 07:31:00,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:00" (2/3) ... [2024-11-10 07:31:00,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726c3b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:31:00, skipping insertion in model container [2024-11-10 07:31:00,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:31:00" (3/3) ... [2024-11-10 07:31:00,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-95.i [2024-11-10 07:31:00,950 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:31:00,951 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:31:01,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:31:01,040 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;@2532afee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:31:01,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:31:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:31:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 07:31:01,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:31:01,057 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:31:01,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:31:01,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:31:01,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1873089446, now seen corresponding path program 1 times [2024-11-10 07:31:01,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:31:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129314606] [2024-11-10 07:31:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:31:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:31:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:31:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:31:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:31:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:31:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:31:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:31:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:31:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 07:31:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:31:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:31:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:31:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 07:31:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:31:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 07:31:01,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:31:01,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129314606] [2024-11-10 07:31:01,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129314606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:31:01,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:31:01,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:31:01,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213603763] [2024-11-10 07:31:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:31:01,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:31:01,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:31:01,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:31:01,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:31:01,429 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:31:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:31:01,459 INFO L93 Difference]: Finished difference Result 90 states and 141 transitions. [2024-11-10 07:31:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:31:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2024-11-10 07:31:01,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:31:01,469 INFO L225 Difference]: With dead ends: 90 [2024-11-10 07:31:01,470 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 07:31:01,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:31:01,480 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:31:01,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:31:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 07:31:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 07:31:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:31:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-10 07:31:01,530 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 85 [2024-11-10 07:31:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:31:01,532 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-10 07:31:01,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:31:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-10 07:31:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 07:31:01,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:31:01,535 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:31:01,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:31:01,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:31:01,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:31:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1051188669, now seen corresponding path program 1 times [2024-11-10 07:31:01,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:31:01,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359123856] [2024-11-10 07:31:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:31:01,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:31:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:31:01,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:31:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:31:01,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:31:01,760 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:31:01,762 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:31:01,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:31:01,767 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 07:31:01,839 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:31:01,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:31:01 BoogieIcfgContainer [2024-11-10 07:31:01,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:31:01,845 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:31:01,845 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:31:01,846 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:31:01,846 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:31:00" (3/4) ... [2024-11-10 07:31:01,849 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:31:01,850 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:31:01,851 INFO L158 Benchmark]: Toolchain (without parser) took 1872.18ms. Allocated memory is still 180.4MB. Free memory was 111.1MB in the beginning and 88.9MB in the end (delta: 22.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-10 07:31:01,852 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 180.4MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:31:01,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.65ms. Allocated memory is still 180.4MB. Free memory was 110.9MB in the beginning and 96.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:31:01,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.87ms. Allocated memory is still 180.4MB. Free memory was 96.8MB in the beginning and 94.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:31:01,854 INFO L158 Benchmark]: Boogie Preprocessor took 50.77ms. Allocated memory is still 180.4MB. Free memory was 94.4MB in the beginning and 91.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:31:01,854 INFO L158 Benchmark]: IcfgBuilder took 521.66ms. Allocated memory is still 180.4MB. Free memory was 91.7MB in the beginning and 138.0MB in the end (delta: -46.4MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-10 07:31:01,857 INFO L158 Benchmark]: TraceAbstraction took 921.28ms. Allocated memory is still 180.4MB. Free memory was 137.1MB in the beginning and 88.9MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-10 07:31:01,857 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 180.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:31:01,859 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.61ms. Allocated memory is still 180.4MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.65ms. Allocated memory is still 180.4MB. Free memory was 110.9MB in the beginning and 96.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.87ms. Allocated memory is still 180.4MB. Free memory was 96.8MB in the beginning and 94.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.77ms. Allocated memory is still 180.4MB. Free memory was 94.4MB in the beginning and 91.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 521.66ms. Allocated memory is still 180.4MB. Free memory was 91.7MB in the beginning and 138.0MB in the end (delta: -46.4MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * TraceAbstraction took 921.28ms. Allocated memory is still 180.4MB. Free memory was 137.1MB in the beginning and 88.9MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 180.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] float var_1_3 = 1.8; [L24] double var_1_5 = -0.75; [L25] double var_1_6 = 128.2; [L26] float var_1_8 = 127.4; [L27] float var_1_9 = 99999999.4; [L28] float var_1_10 = 2.8; [L29] double var_1_11 = 7.875; [L30] unsigned char var_1_12 = 128; [L31] unsigned char var_1_13 = 1; [L32] unsigned char var_1_14 = 25; [L33] unsigned char var_1_15 = 64; [L34] signed short int var_1_16 = 16; VAL [isInitial=0, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L89] isInitial = 1 [L90] FCALL initially() [L91] int k_loop; [L92] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L92] COND TRUE k_loop < 1 [L93] FCALL updateLastVariables() [L94] CALL updateVariables() [L60] var_1_5 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L61] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L62] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L62] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_6=641/5, var_1_8=637/5, var_1_9=499999997/5] [L63] var_1_6 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L64] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L65] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L65] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_8=637/5, var_1_9=499999997/5] [L66] var_1_8 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_9=499999997/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_9=499999997/5] [L67] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5, var_1_9=499999997/5] [L68] var_1_9 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L69] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=14/5, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L71] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=1, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L72] var_1_13 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L73] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L74] CALL assume_abort_if_not(var_1_13 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L74] RET assume_abort_if_not(var_1_13 <= 64) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=25, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L77] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L77] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=64, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L78] var_1_15 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L79] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L80] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=0, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=0, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L80] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, var_1_11=63/8, var_1_12=128, var_1_13=64, var_1_14=63, var_1_15=0, var_1_16=16, var_1_1=-64, var_1_3=9/5] [L94] RET updateVariables() [L95] CALL step() [L38] var_1_11 = (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) - var_1_8) [L39] var_1_12 = ((var_1_13 + var_1_14) + var_1_15) [L40] var_1_16 = var_1_13 [L41] var_1_1 = ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L42] unsigned char stepLocal_2 = var_1_12; [L43] signed long int stepLocal_1 = -128; [L44] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=127, stepLocal_1=-128, stepLocal_2=127, var_1_12=127, var_1_13=64, var_1_14=63, var_1_15=0, var_1_16=64, var_1_1=127, var_1_3=9/5] [L45] COND FALSE !((var_1_11 / ((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) <= var_1_11) VAL [isInitial=1, stepLocal_0=127, stepLocal_1=-128, stepLocal_2=127, var_1_12=127, var_1_13=64, var_1_14=63, var_1_15=0, var_1_16=64, var_1_1=127, var_1_3=9/5] [L95] RET step() [L96] CALL, EXPR property() [L85-L86] return ((((var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) && (((var_1_11 / ((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) <= var_1_11) ? ((var_1_12 == var_1_16) ? ((var_1_12 >= var_1_16) ? (var_1_3 == ((float) ((9.3f - var_1_8) + (var_1_9 + var_1_10)))) : 1) : ((var_1_12 < -128) ? (var_1_3 == ((float) var_1_8)) : (var_1_3 == ((float) var_1_10)))) : 1)) && (var_1_11 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) - var_1_8)))) && (var_1_12 == ((unsigned char) ((var_1_13 + var_1_14) + var_1_15)))) && (var_1_16 == ((signed short int) var_1_13)) ; VAL [\result=0, isInitial=1, var_1_12=127, var_1_13=64, var_1_14=63, var_1_15=0, var_1_16=64, var_1_1=127, var_1_3=9/5] [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=127, var_1_13=64, var_1_14=63, var_1_15=0, var_1_16=64, var_1_1=127, var_1_3=9/5] [L19] reach_error() VAL [isInitial=1, var_1_12=127, var_1_13=64, var_1_14=63, var_1_15=0, var_1_16=64, var_1_1=127, var_1_3=9/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 62 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 312/312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:31:01,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b884f210784373b42c472a85a9cfd5963822e872cafb602d6bfc9ce286fa4e8a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:31:04,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:31:04,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:31:04,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:31:04,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:31:04,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:31:04,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:31:04,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:31:04,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:31:04,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:31:04,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:31:04,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:31:04,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:31:04,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:31:04,282 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:31:04,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:31:04,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:31:04,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:31:04,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:31:04,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:31:04,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:31:04,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:31:04,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:31:04,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:31:04,287 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:31:04,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:31:04,288 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:31:04,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:31:04,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:31:04,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:31:04,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:31:04,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:31:04,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:31:04,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:31:04,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:31:04,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:31:04,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:31:04,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:31:04,293 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:31:04,293 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:31:04,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:31:04,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:31:04,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:31:04,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:31:04,294 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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b884f210784373b42c472a85a9cfd5963822e872cafb602d6bfc9ce286fa4e8a [2024-11-10 07:31:04,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:31:04,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:31:04,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:31:04,659 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:31:04,659 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:31:04,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i [2024-11-10 07:31:06,357 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:31:06,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:31:06,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i [2024-11-10 07:31:06,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca59f83b3/1ff12bab8c564585bd7a323b7c129ade/FLAG7e85bb00f [2024-11-10 07:31:06,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca59f83b3/1ff12bab8c564585bd7a323b7c129ade [2024-11-10 07:31:06,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:31:06,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:31:06,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:31:06,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:31:06,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:31:06,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:06,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5b8d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06, skipping insertion in model container [2024-11-10 07:31:06,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:06,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:31:06,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i[915,928] [2024-11-10 07:31:06,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:31:06,935 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:31:06,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-95.i[915,928] [2024-11-10 07:31:06,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:31:06,995 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:31:06,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06 WrapperNode [2024-11-10 07:31:06,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:31:06,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:31:06,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:31:06,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:31:07,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,053 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-10 07:31:07,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:31:07,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:31:07,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:31:07,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:31:07,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,089 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:31:07,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:31:07,117 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:31:07,118 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:31:07,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:31:07,119 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (1/1) ... [2024-11-10 07:31:07,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:31:07,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:31:07,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:31:07,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:31:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:31:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:31:07,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:31:07,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:31:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:31:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:31:07,276 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:31:07,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:31:21,163 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 07:31:21,163 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:31:21,179 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:31:21,180 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:31:21,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:31:21 BoogieIcfgContainer [2024-11-10 07:31:21,181 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:31:21,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:31:21,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:31:21,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:31:21,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:31:06" (1/3) ... [2024-11-10 07:31:21,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5980a181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:31:21, skipping insertion in model container [2024-11-10 07:31:21,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:31:06" (2/3) ... [2024-11-10 07:31:21,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5980a181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:31:21, skipping insertion in model container [2024-11-10 07:31:21,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:31:21" (3/3) ... [2024-11-10 07:31:21,189 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-95.i [2024-11-10 07:31:21,207 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:31:21,207 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:31:21,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:31:21,290 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;@20033872, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:31:21,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:31:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:31:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 07:31:21,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:31:21,308 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:31:21,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:31:21,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:31:21,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1873089446, now seen corresponding path program 1 times [2024-11-10 07:31:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:31:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806207276] [2024-11-10 07:31:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:31:21,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:31:21,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:31:21,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:31:21,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:31:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:22,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:31:22,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:31:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-10 07:31:22,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:31:22,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:31:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806207276] [2024-11-10 07:31:22,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806207276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:31:22,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:31:22,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:31:22,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721940080] [2024-11-10 07:31:22,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:31:22,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:31:22,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:31:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:31:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:31:22,313 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:31:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:31:22,338 INFO L93 Difference]: Finished difference Result 90 states and 141 transitions. [2024-11-10 07:31:22,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:31:22,340 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2024-11-10 07:31:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:31:22,346 INFO L225 Difference]: With dead ends: 90 [2024-11-10 07:31:22,346 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 07:31:22,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:31:22,352 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:31:22,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:31:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 07:31:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 07:31:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 07:31:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-10 07:31:22,402 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 85 [2024-11-10 07:31:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:31:22,403 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-10 07:31:22,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 07:31:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-10 07:31:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 07:31:22,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:31:22,406 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:31:22,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:31:22,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:31:22,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:31:22,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:31:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1051188669, now seen corresponding path program 1 times [2024-11-10 07:31:22,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:31:22,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744984448] [2024-11-10 07:31:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:31:22,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:31:22,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:31:22,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:31:22,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:31:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:31:25,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 07:31:25,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:32:29,848 WARN L286 SmtUtils]: Spent 15.60s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)