./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.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_operatoramount_amount10_file-26.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 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:16:33,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:16:33,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:16:33,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:16:33,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:16:33,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:16:33,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:16:33,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:16:33,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:16:33,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:16:33,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:16:33,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:16:33,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:16:33,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:16:33,298 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:16:33,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:16:33,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:16:33,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:16:33,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:16:33,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:16:33,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:16:33,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:16:33,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:16:33,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:16:33,303 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:16:33,303 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:16:33,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:16:33,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:16:33,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:16:33,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:16:33,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:16:33,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:16:33,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:33,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:16:33,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:16:33,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:16:33,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:16:33,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:16:33,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:16:33,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:16:33,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:16:33,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:16:33,305 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 -> 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 [2024-11-10 08:16:33,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:16:33,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:16:33,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:16:33,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:16:33,515 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:16:33,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2024-11-10 08:16:34,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:16:34,850 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:16:34,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2024-11-10 08:16:34,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da120271/4cf35d6cc05c4b24980aeae42b07e65a/FLAG9d998baa4 [2024-11-10 08:16:35,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6da120271/4cf35d6cc05c4b24980aeae42b07e65a [2024-11-10 08:16:35,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:16:35,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:16:35,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:35,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:16:35,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:16:35,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a18449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35, skipping insertion in model container [2024-11-10 08:16:35,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:16:35,415 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_operatoramount_amount10_file-26.i[915,928] [2024-11-10 08:16:35,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:35,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:16:35,516 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_operatoramount_amount10_file-26.i[915,928] [2024-11-10 08:16:35,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:35,562 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:16:35,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35 WrapperNode [2024-11-10 08:16:35,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:35,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:35,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:16:35,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:16:35,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,589 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-10 08:16:35,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:35,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:16:35,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:16:35,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:16:35,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,609 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 08:16:35,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,613 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:16:35,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:16:35,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:16:35,617 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:16:35,618 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (1/1) ... [2024-11-10 08:16:35,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:35,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:16:35,641 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 08:16:35,643 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 08:16:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:16:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:16:35,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:16:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:16:35,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:16:35,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:16:35,738 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:16:35,740 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:16:35,902 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:16:35,903 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:16:35,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:16:35,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:16:35,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:35 BoogieIcfgContainer [2024-11-10 08:16:35,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:16:35,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:16:35,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:16:35,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:16:35,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:16:35" (1/3) ... [2024-11-10 08:16:35,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7cf1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:35, skipping insertion in model container [2024-11-10 08:16:35,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:35" (2/3) ... [2024-11-10 08:16:35,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7cf1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:35, skipping insertion in model container [2024-11-10 08:16:35,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:35" (3/3) ... [2024-11-10 08:16:35,926 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-26.i [2024-11-10 08:16:35,939 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:16:35,939 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:16:35,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:16:36,003 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;@71d498cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:16:36,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:16:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 08:16:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 08:16:36,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:36,018 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 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, 1, 1, 1, 1, 1] [2024-11-10 08:16:36,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:36,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash 515519037, now seen corresponding path program 1 times [2024-11-10 08:16:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335012381] [2024-11-10 08:16:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:16:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:16:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:16:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:16:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:16:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:16:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:16:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:16:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:16:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:16:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:16:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:16:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:16:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:16:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:16:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 08:16:36,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:16:36,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335012381] [2024-11-10 08:16:36,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335012381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:36,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:36,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:16:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361043498] [2024-11-10 08:16:36,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:36,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:16:36,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:16:36,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:16:36,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:16:36,309 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 08:16:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:36,329 INFO L93 Difference]: Finished difference Result 86 states and 138 transitions. [2024-11-10 08:16:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:16:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-11-10 08:16:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:36,336 INFO L225 Difference]: With dead ends: 86 [2024-11-10 08:16:36,336 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 08:16:36,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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 08:16:36,342 INFO L432 NwaCegarLoop]: 57 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, 57 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 08:16:36,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 08:16:36,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 08:16:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 08:16:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-11-10 08:16:36,378 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 96 [2024-11-10 08:16:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:36,378 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-11-10 08:16:36,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 08:16:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2024-11-10 08:16:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 08:16:36,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:36,381 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 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, 1, 1, 1, 1, 1] [2024-11-10 08:16:36,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:16:36,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:36,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash -488642180, now seen corresponding path program 1 times [2024-11-10 08:16:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:16:36,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236974310] [2024-11-10 08:16:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:36,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:16:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:16:36,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:16:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:16:36,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:16:36,643 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:16:36,644 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:16:36,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:16:36,648 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:16:36,707 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:16:36,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:16:36 BoogieIcfgContainer [2024-11-10 08:16:36,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:16:36,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:16:36,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:16:36,711 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:16:36,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:35" (3/4) ... [2024-11-10 08:16:36,713 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:16:36,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:16:36,715 INFO L158 Benchmark]: Toolchain (without parser) took 1446.26ms. Allocated memory is still 176.2MB. Free memory was 107.9MB in the beginning and 60.4MB in the end (delta: 47.5MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-11-10 08:16:36,717 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 69.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:36,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.45ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 147.9MB in the end (delta: -40.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-10 08:16:36,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.70ms. Allocated memory is still 176.2MB. Free memory was 147.9MB in the beginning and 146.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:36,718 INFO L158 Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 144.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:36,718 INFO L158 Benchmark]: IcfgBuilder took 299.17ms. Allocated memory is still 176.2MB. Free memory was 144.3MB in the beginning and 130.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:16:36,718 INFO L158 Benchmark]: TraceAbstraction took 790.61ms. Allocated memory is still 176.2MB. Free memory was 129.7MB in the beginning and 61.2MB in the end (delta: 68.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:36,719 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 176.2MB. Free memory was 61.2MB in the beginning and 60.4MB in the end (delta: 751.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:36,721 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 69.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.45ms. Allocated memory is still 176.2MB. Free memory was 107.8MB in the beginning and 147.9MB in the end (delta: -40.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.70ms. Allocated memory is still 176.2MB. Free memory was 147.9MB in the beginning and 146.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.76ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 144.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 299.17ms. Allocated memory is still 176.2MB. Free memory was 144.3MB in the beginning and 130.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 790.61ms. Allocated memory is still 176.2MB. Free memory was 129.7MB in the beginning and 61.2MB in the end (delta: 68.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 176.2MB. Free memory was 61.2MB in the beginning and 60.4MB in the end (delta: 751.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] unsigned long int var_1_3 = 4; [L25] unsigned long int var_1_4 = 64; [L26] unsigned long int var_1_5 = 32; [L27] unsigned long int var_1_6 = 1908995780; [L28] unsigned long int var_1_7 = 0; [L29] double var_1_8 = 1.7; [L30] double var_1_9 = 1.7; [L31] signed short int var_1_10 = -32; [L32] signed short int var_1_11 = -16; VAL [isInitial=0, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L76] isInitial = 1 [L77] FCALL initially() [L78] COND TRUE 1 [L79] FCALL updateLastVariables() [L80] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L48] var_1_3 = __VERIFIER_nondet_ulong() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L50] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L50] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L51] var_1_4 = __VERIFIER_nondet_ulong() [L52] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L52] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L53] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L53] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L54] var_1_5 = __VERIFIER_nondet_ulong() [L55] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L55] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L57] var_1_6 = __VERIFIER_nondet_ulong() [L58] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L58] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L60] var_1_7 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_8=17/10, var_1_9=17/10] [L61] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_8=17/10, var_1_9=17/10] [L62] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10, var_1_9=17/10] [L62] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10, var_1_9=17/10] [L63] var_1_9 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L64] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L65] var_1_11 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_11 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L66] RET assume_abort_if_not(var_1_11 >= -32767) VAL [isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L67] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L67] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=32, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L80] RET updateVariables() [L81] CALL step() [L36] COND FALSE !(\read(var_1_2)) [L39] var_1_1 = (3164264966u - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))) VAL [isInitial=1, var_1_10=-32, var_1_11=32766, var_1_1=3164264966, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=17/10] [L41] var_1_8 = var_1_9 [L42] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3164264966, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=3164264971, var_1_9=3164264971] [L81] RET step() [L82] CALL, EXPR property() [L72-L73] return ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))))) : (var_1_1 == ((unsigned long int) (3164264966u - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7)))))))) && (var_1_8 == ((double) var_1_9))) && (var_1_10 == ((signed short int) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3164264966, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=3164264971, var_1_9=3164264971] [L82] RET, EXPR property() [L82] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3164264966, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=3164264971, var_1_9=3164264971] [L19] reach_error() VAL [isInitial=1, var_1_10=32766, var_1_11=32766, var_1_1=3164264966, var_1_2=0, var_1_3=-4294967298, var_1_4=0, var_1_5=-4294967296, var_1_6=1073741823, var_1_7=1073741823, var_1_8=3164264971, var_1_9=3164264971] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 15, 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, 57 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, 57 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 95 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 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 08:16:36,743 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_operatoramount_amount10_file-26.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 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:16:38,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:16:38,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:16:38,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:16:38,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:16:38,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:16:38,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:16:38,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:16:38,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:16:38,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:16:38,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:16:38,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:16:38,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:16:38,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:16:38,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:16:38,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:16:38,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:16:38,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:16:38,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:16:38,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:16:38,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:16:38,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:16:38,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:16:38,643 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:16:38,643 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:16:38,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:16:38,644 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:16:38,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:16:38,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:16:38,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:16:38,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:16:38,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:16:38,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:16:38,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:16:38,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:38,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:16:38,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:16:38,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:16:38,646 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:16:38,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:16:38,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:16:38,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:16:38,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:16:38,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:16:38,649 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 -> 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 [2024-11-10 08:16:38,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:16:38,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:16:38,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:16:38,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:16:38,933 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:16:38,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2024-11-10 08:16:40,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:16:40,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:16:40,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2024-11-10 08:16:40,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3d1b98a/6e39cd4bc6584173929d755be4c994ae/FLAG816a2397f [2024-11-10 08:16:40,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3d1b98a/6e39cd4bc6584173929d755be4c994ae [2024-11-10 08:16:40,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:16:40,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:16:40,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:40,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:16:40,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:16:40,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49939931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40, skipping insertion in model container [2024-11-10 08:16:40,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:16:40,601 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_operatoramount_amount10_file-26.i[915,928] [2024-11-10 08:16:40,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:40,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:16:40,658 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_operatoramount_amount10_file-26.i[915,928] [2024-11-10 08:16:40,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:16:40,699 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:16:40,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40 WrapperNode [2024-11-10 08:16:40,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:16:40,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:40,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:16:40,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:16:40,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,733 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-10 08:16:40,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:16:40,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:16:40,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:16:40,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:16:40,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,764 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 08:16:40,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:16:40,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:16:40,783 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:16:40,783 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:16:40,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (1/1) ... [2024-11-10 08:16:40,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:16:40,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:16:40,811 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 08:16:40,814 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 08:16:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:16:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:16:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:16:40,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:16:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:16:40,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:16:40,922 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:16:40,926 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:16:41,096 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:16:41,096 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:16:41,107 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:16:41,108 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:16:41,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:41 BoogieIcfgContainer [2024-11-10 08:16:41,108 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:16:41,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:16:41,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:16:41,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:16:41,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:16:40" (1/3) ... [2024-11-10 08:16:41,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1373de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:41, skipping insertion in model container [2024-11-10 08:16:41,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:16:40" (2/3) ... [2024-11-10 08:16:41,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1373de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:16:41, skipping insertion in model container [2024-11-10 08:16:41,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:41" (3/3) ... [2024-11-10 08:16:41,122 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-26.i [2024-11-10 08:16:41,139 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:16:41,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:16:41,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:16:41,196 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;@49045671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:16:41,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:16:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 08:16:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 08:16:41,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:41,206 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 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, 1, 1, 1, 1, 1] [2024-11-10 08:16:41,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash 515519037, now seen corresponding path program 1 times [2024-11-10 08:16:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:16:41,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635711153] [2024-11-10 08:16:41,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:41,220 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 08:16:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:16:41,223 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 08:16:41,223 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 08:16:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:16:41,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:16:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-10 08:16:41,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:16:41,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:16:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635711153] [2024-11-10 08:16:41,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635711153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:16:41,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:16:41,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:16:41,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430425259] [2024-11-10 08:16:41,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:16:41,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:16:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:16:41,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:16:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:16:41,406 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 08:16:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:41,430 INFO L93 Difference]: Finished difference Result 86 states and 138 transitions. [2024-11-10 08:16:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:16:41,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-11-10 08:16:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:41,437 INFO L225 Difference]: With dead ends: 86 [2024-11-10 08:16:41,437 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 08:16:41,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 08:16:41,445 INFO L432 NwaCegarLoop]: 57 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, 57 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 08:16:41,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:16:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 08:16:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-10 08:16:41,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 08:16:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-11-10 08:16:41,488 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 96 [2024-11-10 08:16:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:41,488 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-11-10 08:16:41,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 08:16:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2024-11-10 08:16:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 08:16:41,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:41,491 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 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, 1, 1, 1, 1, 1] [2024-11-10 08:16:41,495 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 08:16:41,691 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 08:16:41,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:41,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash -488642180, now seen corresponding path program 1 times [2024-11-10 08:16:41,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:16:41,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253365095] [2024-11-10 08:16:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:41,693 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 08:16:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:16:41,696 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 08:16:41,710 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 08:16:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:41,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:16:41,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:16:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-10 08:16:43,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:16:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-10 08:16:44,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:16:44,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253365095] [2024-11-10 08:16:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253365095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:16:44,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:16:44,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-10 08:16:44,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033482102] [2024-11-10 08:16:44,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:16:44,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 08:16:44,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:16:44,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 08:16:44,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-10 08:16:44,270 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-10 08:16:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:45,231 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2024-11-10 08:16:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 08:16:45,232 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 96 [2024-11-10 08:16:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:45,234 INFO L225 Difference]: With dead ends: 59 [2024-11-10 08:16:45,234 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 08:16:45,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2024-11-10 08:16:45,235 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 99 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:45,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 208 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:16:45,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 08:16:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-11-10 08:16:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 08:16:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-11-10 08:16:45,249 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 96 [2024-11-10 08:16:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:45,251 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-10 08:16:45,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-10 08:16:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-11-10 08:16:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 08:16:45,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:16:45,253 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 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, 1, 1, 1, 1, 1] [2024-11-10 08:16:45,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 08:16:45,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:16:45,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:16:45,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:16:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1376145861, now seen corresponding path program 1 times [2024-11-10 08:16:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:16:45,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678999590] [2024-11-10 08:16:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:16:45,457 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 08:16:45,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:16:45,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:16:45,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 08:16:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:16:45,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:16:45,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:16:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-10 08:16:46,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:16:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-10 08:16:48,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:16:48,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678999590] [2024-11-10 08:16:48,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678999590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:16:48,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:16:48,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-11-10 08:16:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506938737] [2024-11-10 08:16:48,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:16:48,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 08:16:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:16:48,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 08:16:48,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-10 08:16:48,215 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-10 08:16:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:16:49,154 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2024-11-10 08:16:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 08:16:49,155 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 96 [2024-11-10 08:16:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:16:49,156 INFO L225 Difference]: With dead ends: 56 [2024-11-10 08:16:49,156 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:16:49,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2024-11-10 08:16:49,157 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 76 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 08:16:49,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 180 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 08:16:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:16:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:16:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:16:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:16:49,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2024-11-10 08:16:49,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:16:49,159 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:16:49,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-11-10 08:16:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:16:49,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:16:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:16:49,166 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-11-10 08:16:49,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:16:49,368 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:16:49,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:16:49,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:16:49,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:16:49,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-10 08:16:49,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-10 08:16:49,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-10 08:16:49,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:16:49 BoogieIcfgContainer [2024-11-10 08:16:49,918 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:16:49,919 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:16:49,919 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:16:49,919 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:16:49,919 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:16:41" (3/4) ... [2024-11-10 08:16:49,921 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:16:49,924 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:16:49,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:16:49,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:16:49,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:16:49,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:16:49,994 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:16:49,994 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:16:49,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:16:49,995 INFO L158 Benchmark]: Toolchain (without parser) took 9578.15ms. Allocated memory was 56.6MB in the beginning and 356.5MB in the end (delta: 299.9MB). Free memory was 28.3MB in the beginning and 276.7MB in the end (delta: -248.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2024-11-10 08:16:49,996 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:16:49,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.27ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 28.0MB in the beginning and 49.2MB in the end (delta: -21.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.58ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,002 INFO L158 Benchmark]: Boogie Preprocessor took 47.42ms. Allocated memory is still 75.5MB. Free memory was 47.5MB in the beginning and 45.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,002 INFO L158 Benchmark]: IcfgBuilder took 325.78ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 31.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,002 INFO L158 Benchmark]: TraceAbstraction took 8802.66ms. Allocated memory was 75.5MB in the beginning and 356.5MB in the end (delta: 281.0MB). Free memory was 54.0MB in the beginning and 282.9MB in the end (delta: -228.9MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,002 INFO L158 Benchmark]: Witness Printer took 75.67ms. Allocated memory is still 356.5MB. Free memory was 282.9MB in the beginning and 276.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:16:50,004 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.77ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.27ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 28.0MB in the beginning and 49.2MB in the end (delta: -21.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.58ms. Allocated memory is still 75.5MB. Free memory was 49.2MB in the beginning and 47.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.42ms. Allocated memory is still 75.5MB. Free memory was 47.5MB in the beginning and 45.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 325.78ms. Allocated memory is still 75.5MB. Free memory was 45.4MB in the beginning and 31.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8802.66ms. Allocated memory was 75.5MB in the beginning and 356.5MB in the end (delta: 281.0MB). Free memory was 54.0MB in the beginning and 282.9MB in the end (delta: -228.9MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Witness Printer took 75.67ms. Allocated memory is still 356.5MB. Free memory was 282.9MB in the beginning and 276.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 177 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 445 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 438 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 135 mSDtfsCounter, 438 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 475 ConstructedInterpolants, 2 QuantifiedInterpolants, 2770 SizeOfPredicates, 38 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1880/2100 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 78]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:16:50,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE