./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.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 087f53d60a69a89d74f854e09dec49f6677e36a3379c1213b60b4862ed153ba1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:19:01,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:19:01,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:19:01,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:19:01,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:19:01,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:19:01,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:19:01,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:19:01,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:19:01,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:19:01,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:19:01,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:19:01,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:19:01,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:19:01,136 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:19:01,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:19:01,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:19:01,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:19:01,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:19:01,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:19:01,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:19:01,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:19:01,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:19:01,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:19:01,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:19:01,139 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:19:01,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:19:01,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:19:01,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:19:01,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:19:01,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:19:01,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:19:01,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:01,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:19:01,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:19:01,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:19:01,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:19:01,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:19:01,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:19:01,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:19:01,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:19:01,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:19:01,144 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 -> 087f53d60a69a89d74f854e09dec49f6677e36a3379c1213b60b4862ed153ba1 [2024-10-24 10:19:01,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:19:01,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:19:01,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:19:01,434 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:19:01,435 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:19:01,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.i [2024-10-24 10:19:02,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:19:03,024 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:19:03,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.i [2024-10-24 10:19:03,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150bf63b6/1c3a1d5ba21042b3973702c91180025b/FLAG594785440 [2024-10-24 10:19:03,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150bf63b6/1c3a1d5ba21042b3973702c91180025b [2024-10-24 10:19:03,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:19:03,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:19:03,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:03,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:19:03,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:19:03,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d8e438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03, skipping insertion in model container [2024-10-24 10:19:03,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:19:03,259 WARN L248 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-4.i[914,927] [2024-10-24 10:19:03,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:03,313 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:19:03,326 WARN L248 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-4.i[914,927] [2024-10-24 10:19:03,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:03,357 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:19:03,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03 WrapperNode [2024-10-24 10:19:03,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:03,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:03,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:19:03,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:19:03,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,397 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 68 [2024-10-24 10:19:03,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:03,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:19:03,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:19:03,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:19:03,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,420 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-10-24 10:19:03,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:19:03,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:19:03,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:19:03,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:19:03,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (1/1) ... [2024-10-24 10:19:03,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:03,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:19:03,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:19:03,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:19:03,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:19:03,536 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:19:03,536 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:19:03,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:19:03,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:19:03,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:19:03,613 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:19:03,615 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:19:03,838 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:19:03,839 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:19:03,880 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:19:03,881 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:19:03,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:03 BoogieIcfgContainer [2024-10-24 10:19:03,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:19:03,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:19:03,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:19:03,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:19:03,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:19:03" (1/3) ... [2024-10-24 10:19:03,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5297a4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:03, skipping insertion in model container [2024-10-24 10:19:03,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:03" (2/3) ... [2024-10-24 10:19:03,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5297a4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:03, skipping insertion in model container [2024-10-24 10:19:03,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:03" (3/3) ... [2024-10-24 10:19:03,895 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-4.i [2024-10-24 10:19:03,911 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:19:03,912 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:19:03,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:19:03,974 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;@668f5554, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:19:03,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:19:03,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:19:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 10:19:03,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:03,986 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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-10-24 10:19:03,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:03,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash -965972443, now seen corresponding path program 1 times [2024-10-24 10:19:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786976255] [2024-10-24 10:19:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:19:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:04,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:19:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:19:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:19:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:04,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:19:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:04,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:19:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:04,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:19:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:19:04,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:19:04,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786976255] [2024-10-24 10:19:04,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786976255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:04,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:04,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:19:04,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902842392] [2024-10-24 10:19:04,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:04,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:19:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:19:04,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:19:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:04,231 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:19:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:04,258 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2024-10-24 10:19:04,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:19:04,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2024-10-24 10:19:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:04,271 INFO L225 Difference]: With dead ends: 47 [2024-10-24 10:19:04,272 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 10:19:04,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:04,279 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:04,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:19:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 10:19:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-24 10:19:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:19:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-24 10:19:04,325 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 45 [2024-10-24 10:19:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:04,326 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-24 10:19:04,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:19:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-24 10:19:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 10:19:04,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:04,330 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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-10-24 10:19:04,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:19:04,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:04,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash 12048035, now seen corresponding path program 1 times [2024-10-24 10:19:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:19:04,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613413008] [2024-10-24 10:19:04,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:04,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:19:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:19:04,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:19:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:19:04,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:19:04,489 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:19:04,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:19:04,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:19:04,495 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 10:19:04,530 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:19:04,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:19:04 BoogieIcfgContainer [2024-10-24 10:19:04,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:19:04,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:19:04,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:19:04,535 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:19:04,536 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:03" (3/4) ... [2024-10-24 10:19:04,538 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:19:04,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:19:04,540 INFO L158 Benchmark]: Toolchain (without parser) took 1490.76ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 88.7MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 10:19:04,540 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 142.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:04,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.88ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 110.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:19:04,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.35ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 108.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:04,542 INFO L158 Benchmark]: Boogie Preprocessor took 32.58ms. Allocated memory is still 161.5MB. Free memory was 108.8MB in the beginning and 106.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:04,542 INFO L158 Benchmark]: RCFGBuilder took 449.74ms. Allocated memory is still 161.5MB. Free memory was 106.8MB in the beginning and 125.9MB in the end (delta: -19.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:19:04,543 INFO L158 Benchmark]: TraceAbstraction took 647.47ms. Allocated memory is still 161.5MB. Free memory was 125.2MB in the beginning and 89.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-24 10:19:04,543 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 161.5MB. Free memory was 89.5MB in the beginning and 88.7MB in the end (delta: 801.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:04,546 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.16ms. Allocated memory is still 109.1MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 142.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.88ms. Allocated memory is still 161.5MB. Free memory was 123.5MB in the beginning and 110.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.35ms. Allocated memory is still 161.5MB. Free memory was 110.4MB in the beginning and 108.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.58ms. Allocated memory is still 161.5MB. Free memory was 108.8MB in the beginning and 106.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.74ms. Allocated memory is still 161.5MB. Free memory was 106.8MB in the beginning and 125.9MB in the end (delta: -19.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 647.47ms. Allocated memory is still 161.5MB. Free memory was 125.2MB in the beginning and 89.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 161.5MB. Free memory was 89.5MB in the beginning and 88.7MB in the end (delta: 801.5kB). 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 someBinaryFLOATComparisonOperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -16; [L23] signed short int var_1_2 = 16; [L24] signed short int var_1_3 = 25; [L25] signed long int var_1_4 = -32; [L26] unsigned char var_1_5 = 1; [L27] float var_1_6 = 0.6599999999999999; [L28] float var_1_7 = 256.6; [L60] isInitial = 1 [L61] FCALL initially() [L62] COND TRUE 1 [L63] FCALL updateLastVariables() [L64] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_short() [L42] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L42] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L43] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L43] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=25, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L44] var_1_3 = __VERIFIER_nondet_short() [L45] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L45] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L46] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L46] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=-32, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L47] var_1_4 = __VERIFIER_nondet_long() [L48] CALL assume_abort_if_not(var_1_4 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L48] RET assume_abort_if_not(var_1_4 >= -2147483647) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L49] CALL assume_abort_if_not(var_1_4 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L49] RET assume_abort_if_not(var_1_4 <= 2147483646) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000, var_1_7=1283/5] [L50] var_1_7 = __VERIFIER_nondet_float() [L51] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L51] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-16, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L64] RET updateVariables() [L65] CALL step() [L32] COND FALSE !(var_1_2 <= var_1_3) [L35] var_1_1 = ((((var_1_4) > (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))))) ? (var_1_4) : (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2)))))) VAL [isInitial=1, var_1_1=4, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=1, var_1_6=6599999999999999/10000000000000000] [L37] var_1_5 = 0 [L38] var_1_6 = var_1_7 [L65] RET step() [L66] CALL, EXPR property() [L56-L57] return (((var_1_2 <= var_1_3) ? (var_1_1 == ((signed long int) ((((var_1_2) < ((var_1_3 + -50))) ? (var_1_2) : ((var_1_3 + -50)))))) : (var_1_1 == ((signed long int) ((((var_1_4) > (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))))) ? (var_1_4) : (((((var_1_3) < (var_1_2)) ? (var_1_3) : (var_1_2))))))))) && (var_1_5 == ((unsigned char) 0))) && (var_1_6 == ((float) var_1_7)) ; [L66] RET, EXPR property() [L66] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=4, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=261, var_1_7=261] [L19] reach_error() VAL [isInitial=1, var_1_1=4, var_1_2=8, var_1_3=4, var_1_4=4, var_1_5=0, var_1_6=261, var_1_7=261] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 7, 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, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 27 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 44 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 84/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:19:04,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.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 087f53d60a69a89d74f854e09dec49f6677e36a3379c1213b60b4862ed153ba1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:19:06,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:19:06,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:19:06,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:19:06,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:19:06,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:19:06,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:19:06,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:19:06,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:19:06,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:19:06,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:19:06,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:19:06,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:19:06,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:19:06,840 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:19:06,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:19:06,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:19:06,842 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:19:06,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:19:06,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:19:06,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:19:06,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:19:06,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:19:06,844 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:19:06,844 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:19:06,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:19:06,844 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:19:06,845 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:19:06,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:19:06,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:19:06,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:19:06,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:19:06,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:19:06,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:19:06,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:06,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:19:06,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:19:06,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:19:06,847 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:19:06,847 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:19:06,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:19:06,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:19:06,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:19:06,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:19:06,849 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:19:06,850 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 -> 087f53d60a69a89d74f854e09dec49f6677e36a3379c1213b60b4862ed153ba1 [2024-10-24 10:19:07,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:19:07,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:19:07,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:19:07,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:19:07,178 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:19:07,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.i [2024-10-24 10:19:08,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:19:08,945 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:19:08,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-4.i [2024-10-24 10:19:08,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a718c85e/93703695accc4e4ba9bf734850456089/FLAG9e40c4999 [2024-10-24 10:19:09,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a718c85e/93703695accc4e4ba9bf734850456089 [2024-10-24 10:19:09,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:19:09,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:19:09,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:09,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:19:09,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:19:09,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290165e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09, skipping insertion in model container [2024-10-24 10:19:09,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:19:09,462 WARN L248 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-4.i[914,927] [2024-10-24 10:19:09,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:09,511 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:19:09,524 WARN L248 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-4.i[914,927] [2024-10-24 10:19:09,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:19:09,582 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:19:09,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09 WrapperNode [2024-10-24 10:19:09,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:19:09,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:09,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:19:09,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:19:09,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,628 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2024-10-24 10:19:09,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:19:09,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:19:09,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:19:09,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:19:09,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,658 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-10-24 10:19:09,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:19:09,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:19:09,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:19:09,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:19:09,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (1/1) ... [2024-10-24 10:19:09,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:19:09,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:19:09,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:19:09,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:19:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:19:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:19:09,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:19:09,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:19:09,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:19:09,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:19:09,851 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:19:09,853 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:19:10,033 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:19:10,033 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:19:10,105 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:19:10,106 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:19:10,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:10 BoogieIcfgContainer [2024-10-24 10:19:10,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:19:10,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:19:10,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:19:10,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:19:10,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:19:09" (1/3) ... [2024-10-24 10:19:10,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b572da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:10, skipping insertion in model container [2024-10-24 10:19:10,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:19:09" (2/3) ... [2024-10-24 10:19:10,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b572da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:19:10, skipping insertion in model container [2024-10-24 10:19:10,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:10" (3/3) ... [2024-10-24 10:19:10,117 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-4.i [2024-10-24 10:19:10,134 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:19:10,134 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:19:10,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:19:10,220 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;@5e72b357, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:19:10,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:19:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:19:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 10:19:10,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:10,233 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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-10-24 10:19:10,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:10,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:10,239 INFO L85 PathProgramCache]: Analyzing trace with hash -965972443, now seen corresponding path program 1 times [2024-10-24 10:19:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:19:10,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810978330] [2024-10-24 10:19:10,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:10,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:10,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:19:10,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:19:10,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:19:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:10,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:19:10,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:19:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 10:19:10,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:19:10,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:19:10,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810978330] [2024-10-24 10:19:10,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810978330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:10,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:10,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:19:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639895917] [2024-10-24 10:19:10,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:10,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:19:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:19:10,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:19:10,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:10,498 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:19:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:10,538 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2024-10-24 10:19:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:19:10,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2024-10-24 10:19:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:10,548 INFO L225 Difference]: With dead ends: 47 [2024-10-24 10:19:10,548 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 10:19:10,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:19:10,554 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:10,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:19:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 10:19:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-24 10:19:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:19:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-24 10:19:10,591 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 45 [2024-10-24 10:19:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:10,592 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-24 10:19:10,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:19:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-24 10:19:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 10:19:10,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:10,595 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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-10-24 10:19:10,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 10:19:10,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:10,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:10,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash 12048035, now seen corresponding path program 1 times [2024-10-24 10:19:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:19:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040282781] [2024-10-24 10:19:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:19:10,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:19:10,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:19:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:10,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:19:10,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:19:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 10:19:14,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:19:14,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:19:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040282781] [2024-10-24 10:19:14,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040282781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:14,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:14,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:19:14,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915166699] [2024-10-24 10:19:14,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:14,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:19:14,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:19:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:19:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:19:14,935 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:15,415 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-24 10:19:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 10:19:15,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2024-10-24 10:19:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:15,417 INFO L225 Difference]: With dead ends: 35 [2024-10-24 10:19:15,417 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 10:19:15,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-24 10:19:15,419 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:15,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:19:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 10:19:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-10-24 10:19:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:19:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-24 10:19:15,429 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 45 [2024-10-24 10:19:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:15,429 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-24 10:19:15,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-24 10:19:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 10:19:15,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:19:15,431 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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-10-24 10:19:15,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 10:19:15,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:15,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:19:15,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:19:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash 11988453, now seen corresponding path program 1 times [2024-10-24 10:19:15,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:19:15,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523999330] [2024-10-24 10:19:15,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:19:15,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:15,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:19:15,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:19:15,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:19:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:19:15,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:19:15,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:19:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 10:19:18,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:19:18,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:19:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523999330] [2024-10-24 10:19:18,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523999330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:19:18,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:19:18,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:19:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240637622] [2024-10-24 10:19:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:19:18,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:19:18,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:19:18,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:19:18,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:19:18,460 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:19:18,885 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-10-24 10:19:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 10:19:18,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2024-10-24 10:19:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:19:18,886 INFO L225 Difference]: With dead ends: 33 [2024-10-24 10:19:18,886 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:19:18,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-24 10:19:18,888 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:19:18,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:19:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:19:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:19:18,889 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-10-24 10:19:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:19:18,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-10-24 10:19:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:19:18,890 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:19:18,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:19:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:19:18,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:19:18,894 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:19:18,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 10:19:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:19:19,102 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:19:19,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:19:19,589 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:19:19,604 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:19,606 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:19,606 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:19,606 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:19,606 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:19:19,607 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:19,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:19:19,611 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:19,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:19:19,613 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:19:19,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:19:19 BoogieIcfgContainer [2024-10-24 10:19:19,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:19:19,619 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:19:19,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:19:19,620 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:19:19,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:19:10" (3/4) ... [2024-10-24 10:19:19,622 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:19:19,626 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:19:19,629 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 10:19:19,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-24 10:19:19,631 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:19:19,631 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:19:19,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:19:19,722 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:19:19,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:19:19,723 INFO L158 Benchmark]: Toolchain (without parser) took 10438.81ms. Allocated memory was 67.1MB in the beginning and 436.2MB in the end (delta: 369.1MB). Free memory was 45.0MB in the beginning and 401.2MB in the end (delta: -356.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-10-24 10:19:19,723 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:19:19,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.46ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 31.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:19:19,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.20ms. Allocated memory is still 67.1MB. Free memory was 31.1MB in the beginning and 29.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:19:19,724 INFO L158 Benchmark]: Boogie Preprocessor took 56.93ms. Allocated memory is still 67.1MB. Free memory was 29.3MB in the beginning and 47.1MB in the end (delta: -17.9MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-10-24 10:19:19,724 INFO L158 Benchmark]: RCFGBuilder took 415.28ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 31.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:19:19,724 INFO L158 Benchmark]: TraceAbstraction took 9510.49ms. Allocated memory was 67.1MB in the beginning and 436.2MB in the end (delta: 369.1MB). Free memory was 30.9MB in the beginning and 405.4MB in the end (delta: -374.4MB). Peak memory consumption was 104.3MB. Max. memory is 16.1GB. [2024-10-24 10:19:19,724 INFO L158 Benchmark]: Witness Printer took 103.21ms. Allocated memory is still 436.2MB. Free memory was 405.4MB in the beginning and 401.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:19:19,726 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.17ms. Allocated memory is still 48.2MB. Free memory is still 25.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.46ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 31.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.20ms. Allocated memory is still 67.1MB. Free memory was 31.1MB in the beginning and 29.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.93ms. Allocated memory is still 67.1MB. Free memory was 29.3MB in the beginning and 47.1MB in the end (delta: -17.9MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * RCFGBuilder took 415.28ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 31.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9510.49ms. Allocated memory was 67.1MB in the beginning and 436.2MB in the end (delta: 369.1MB). Free memory was 30.9MB in the beginning and 405.4MB in the end (delta: -374.4MB). Peak memory consumption was 104.3MB. Max. memory is 16.1GB. * Witness Printer took 103.21ms. Allocated memory is still 436.2MB. Free memory was 405.4MB in the beginning and 401.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - 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 - 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 61 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=2, InterpolantAutomatonStates: 24, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 524 SizeOfPredicates, 16 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 252/252 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: 62]: Loop Invariant Derived loop 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)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:19:19,760 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