./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-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:19:11,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:19:11,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:19:11,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:19:11,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:19:11,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:19:11,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:19:11,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:19:11,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:19:11,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:19:11,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:19:11,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:19:11,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:19:11,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:19:11,927 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:19:11,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:19:11,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:19:11,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:19:11,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:19:11,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:19:11,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:19:11,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:19:11,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:19:11,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:19:11,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:19:11,934 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:19:11,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:19:11,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:19:11,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:19:11,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:19:11,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:19:11,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:19:11,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:19:11,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:19:11,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:19:11,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:19:11,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:19:11,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:19:11,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:19:11,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:19:11,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:19:11,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:19:11,941 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-clean/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-clean/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 -> 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e [2024-10-11 12:19:12,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:19:12,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:19:12,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:19:12,233 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:19:12,233 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:19:12,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2024-10-11 12:19:13,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:19:14,055 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:19:14,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2024-10-11 12:19:14,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/362c132e7/71066fffdf894e8d902c70427d3a2a29/FLAG274ac36c9 [2024-10-11 12:19:14,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/362c132e7/71066fffdf894e8d902c70427d3a2a29 [2024-10-11 12:19:14,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:19:14,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:19:14,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:14,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:19:14,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:19:14,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ba2d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14, skipping insertion in model container [2024-10-11 12:19:14,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:19:14,292 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-32.i[915,928] [2024-10-11 12:19:14,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:14,344 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:19:14,355 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-32.i[915,928] [2024-10-11 12:19:14,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:14,398 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:19:14,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14 WrapperNode [2024-10-11 12:19:14,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:14,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:14,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:19:14,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:19:14,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,483 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 67 [2024-10-11 12:19:14,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:14,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:19:14,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:19:14,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:19:14,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,556 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-11 12:19:14,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:19:14,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:19:14,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:19:14,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:19:14,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (1/1) ... [2024-10-11 12:19:14,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:19:14,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:19:14,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:19:14,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:19:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:19:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:19:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:19:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:19:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:19:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:19:14,768 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:19:14,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:19:15,054 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:19:15,055 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:19:15,130 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:19:15,133 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:19:15,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:15 BoogieIcfgContainer [2024-10-11 12:19:15,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:19:15,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:19:15,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:19:15,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:19:15,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:19:14" (1/3) ... [2024-10-11 12:19:15,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d1307a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:15, skipping insertion in model container [2024-10-11 12:19:15,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:14" (2/3) ... [2024-10-11 12:19:15,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d1307a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:15, skipping insertion in model container [2024-10-11 12:19:15,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:15" (3/3) ... [2024-10-11 12:19:15,142 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-32.i [2024-10-11 12:19:15,160 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:19:15,160 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:19:15,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:19:15,234 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;@11d11504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:19:15,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:19:15,240 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-11 12:19:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 12:19:15,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:15,249 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-11 12:19:15,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:15,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash -927732406, now seen corresponding path program 1 times [2024-10-11 12:19:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:19:15,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706063453] [2024-10-11 12:19:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:19:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:19:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:15,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:19:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:15,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:19:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:19:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:15,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:19:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:15,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:19:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:15,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:19:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:15,458 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-11 12:19:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:19:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706063453] [2024-10-11 12:19:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706063453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:19:15,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:19:15,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:19:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909678323] [2024-10-11 12:19:15,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:19:15,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:19:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:19:15,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:19:15,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:19:15,493 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-11 12:19:15,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:15,529 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2024-10-11 12:19:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:19:15,532 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-11 12:19:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:15,538 INFO L225 Difference]: With dead ends: 47 [2024-10-11 12:19:15,538 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 12:19:15,541 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-11 12:19:15,544 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-11 12:19:15,545 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-11 12:19:15,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 12:19:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 12:19:15,575 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-11 12:19:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-11 12:19:15,578 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 45 [2024-10-11 12:19:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:15,578 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-11 12:19:15,579 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-11 12:19:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-11 12:19:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 12:19:15,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:15,581 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-11 12:19:15,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:19:15,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:15,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash 474599308, now seen corresponding path program 1 times [2024-10-11 12:19:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:19:15,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156216707] [2024-10-11 12:19:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:19:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:19:15,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:19:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:19:15,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:19:15,743 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:19:15,745 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:19:15,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:19:15,751 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:19:15,844 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:19:15,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:19:15 BoogieIcfgContainer [2024-10-11 12:19:15,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:19:15,855 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:19:15,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:19:15,858 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:19:15,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:15" (3/4) ... [2024-10-11 12:19:15,900 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:19:15,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:19:15,903 INFO L158 Benchmark]: Toolchain (without parser) took 1819.23ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 96.3MB in the beginning and 209.2MB in the end (delta: -112.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:15,903 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:15,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.20ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 83.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:19:15,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.74ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 137.9MB in the end (delta: -54.7MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-10-11 12:19:15,905 INFO L158 Benchmark]: Boogie Preprocessor took 88.93ms. Allocated memory is still 167.8MB. Free memory was 137.9MB in the beginning and 137.8MB in the end (delta: 89.3kB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-10-11 12:19:15,909 INFO L158 Benchmark]: RCFGBuilder took 555.44ms. Allocated memory is still 167.8MB. Free memory was 137.8MB in the beginning and 121.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:19:15,910 INFO L158 Benchmark]: TraceAbstraction took 718.69ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 119.9MB in the beginning and 209.2MB in the end (delta: -89.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 12:19:15,910 INFO L158 Benchmark]: Witness Printer took 46.32ms. Allocated memory is still 241.2MB. Free memory is still 209.2MB. Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:19:15,913 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 167.8MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.20ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 83.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.74ms. Allocated memory is still 167.8MB. Free memory was 83.2MB in the beginning and 137.9MB in the end (delta: -54.7MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.93ms. Allocated memory is still 167.8MB. Free memory was 137.9MB in the beginning and 137.8MB in the end (delta: 89.3kB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * RCFGBuilder took 555.44ms. Allocated memory is still 167.8MB. Free memory was 137.8MB in the beginning and 121.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 718.69ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 119.9MB in the beginning and 209.2MB in the end (delta: -89.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 46.32ms. Allocated memory is still 241.2MB. Free memory is still 209.2MB. 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 short int var_1_1 = 4; [L23] unsigned char var_1_2 = 1; [L24] signed short int var_1_5 = -32475; [L25] float var_1_7 = 7.2; [L26] float var_1_8 = 500.4; [L27] unsigned char var_1_9 = 10; [L28] unsigned char var_1_10 = 16; [L29] unsigned short int var_1_11 = 4; [L60] isInitial = 1 [L61] FCALL initially() [L62] COND TRUE 1 [L63] FCALL updateLastVariables() [L64] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_uchar() [L42] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L42] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L43] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L43] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-32475, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L44] var_1_5 = __VERIFIER_nondet_short() [L45] CALL assume_abort_if_not(var_1_5 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L45] RET assume_abort_if_not(var_1_5 >= -32766) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L46] CALL assume_abort_if_not(var_1_5 <= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L46] RET assume_abort_if_not(var_1_5 <= -16383) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_8=2502/5, var_1_9=10] [L47] var_1_8 = __VERIFIER_nondet_float() [L48] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L48] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=16, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L49] var_1_10 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L50] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L51] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L51] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=36/5, var_1_9=10] [L64] RET updateVariables() [L65] CALL step() [L33] var_1_7 = var_1_8 [L34] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] [L35] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] [L38] var_1_11 = var_1_1 [L65] RET step() [L66] CALL, EXPR property() [L56-L57] return (((var_1_2 ? (var_1_1 == ((signed short int) ((((((var_1_9 + 16)) > (var_1_9)) ? ((var_1_9 + 16)) : (var_1_9))) - (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) - var_1_9)))) : 1) && (var_1_7 == ((float) var_1_8))) && (var_1_9 == ((unsigned char) var_1_10))) && (var_1_11 == ((unsigned short int) var_1_1)) ; [L66] RET, EXPR property() [L66] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, var_1_10=-2, var_1_11=4, var_1_1=4, var_1_2=0, var_1_5=-16383, var_1_7=505, var_1_8=505, var_1_9=-2] - 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-11 12:19:15,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:19:18,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:19:18,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:19:18,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:19:18,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:19:18,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:19:18,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:19:18,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:19:18,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:19:18,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:19:18,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:19:18,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:19:18,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:19:18,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:19:18,417 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:19:18,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:19:18,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:19:18,418 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:19:18,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:19:18,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:19:18,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:19:18,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:19:18,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:19:18,426 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:19:18,426 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:19:18,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:19:18,426 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:19:18,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:19:18,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:19:18,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:19:18,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:19:18,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:19:18,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:19:18,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:19:18,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:19:18,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:19:18,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:19:18,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:19:18,430 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:19:18,430 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:19:18,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:19:18,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:19:18,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:19:18,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:19:18,431 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:19:18,432 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-clean/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-clean/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 -> 67d7a7169c3a651986674642d9c97cbbd9936901b5f185205eb535897337bc6e [2024-10-11 12:19:18,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:19:18,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:19:18,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:19:18,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:19:18,805 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:19:18,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2024-10-11 12:19:20,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:19:20,796 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:19:20,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-32.i [2024-10-11 12:19:20,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/018181a71/dfe5148ce86f4c14aa06e7e217cbd7a5/FLAG6150620d4 [2024-10-11 12:19:20,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/018181a71/dfe5148ce86f4c14aa06e7e217cbd7a5 [2024-10-11 12:19:20,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:19:20,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:19:20,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:20,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:19:20,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:19:20,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1371f944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20, skipping insertion in model container [2024-10-11 12:19:20,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:19:21,061 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-32.i[915,928] [2024-10-11 12:19:21,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:21,125 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:19:21,167 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-32.i[915,928] [2024-10-11 12:19:21,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:21,206 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:19:21,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21 WrapperNode [2024-10-11 12:19:21,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:21,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:21,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:19:21,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:19:21,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,260 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 66 [2024-10-11 12:19:21,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:21,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:19:21,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:19:21,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:19:21,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,296 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-11 12:19:21,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:19:21,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:19:21,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:19:21,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:19:21,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (1/1) ... [2024-10-11 12:19:21,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:19:21,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:19:21,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:19:21,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:19:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:19:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:19:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:19:21,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:19:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:19:21,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:19:21,491 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:19:21,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:19:21,696 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:19:21,697 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:19:21,785 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:19:21,785 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:19:21,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:21 BoogieIcfgContainer [2024-10-11 12:19:21,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:19:21,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:19:21,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:19:21,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:19:21,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:19:20" (1/3) ... [2024-10-11 12:19:21,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65538655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:21, skipping insertion in model container [2024-10-11 12:19:21,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:21" (2/3) ... [2024-10-11 12:19:21,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65538655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:21, skipping insertion in model container [2024-10-11 12:19:21,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:21" (3/3) ... [2024-10-11 12:19:21,797 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-32.i [2024-10-11 12:19:21,815 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:19:21,815 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:19:21,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:19:21,897 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;@2ce7893e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:19:21,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:19:21,902 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-11 12:19:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 12:19:21,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:21,911 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-11 12:19:21,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:21,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash -927732406, now seen corresponding path program 1 times [2024-10-11 12:19:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:21,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498140560] [2024-10-11 12:19:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:21,933 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-11 12:19:21,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:21,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 12:19:21,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:19:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:22,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:19:22,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 12:19:22,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:19:22,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498140560] [2024-10-11 12:19:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498140560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:19:22,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:19:22,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:19:22,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031961591] [2024-10-11 12:19:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:19:22,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:19:22,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:19:22,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:19:22,219 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-11 12:19:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:22,262 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2024-10-11 12:19:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:19:22,266 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-11 12:19:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:22,274 INFO L225 Difference]: With dead ends: 47 [2024-10-11 12:19:22,274 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 12:19:22,277 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-11 12:19:22,283 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-11 12:19:22,284 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-11 12:19:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 12:19:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 12:19:22,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-11 12:19:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-11 12:19:22,327 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 45 [2024-10-11 12:19:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:22,328 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-11 12:19:22,328 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-11 12:19:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-11 12:19:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 12:19:22,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:22,332 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-11 12:19:22,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:19:22,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 12:19:22,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash 474599308, now seen corresponding path program 1 times [2024-10-11 12:19:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:22,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572977680] [2024-10-11 12:19:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:22,543 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-11 12:19:22,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:22,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 12:19:22,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:19:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:22,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 12:19:22,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 12:19:30,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:19:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 12:19:38,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:38,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572977680] [2024-10-11 12:19:38,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572977680] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:19:38,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:19:38,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 12:19:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660058973] [2024-10-11 12:19:38,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:19:38,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 12:19:38,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 12:19:38,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:19:38,262 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 12:19:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:40,426 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-10-11 12:19:40,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 12:19:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2024-10-11 12:19:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:40,429 INFO L225 Difference]: With dead ends: 48 [2024-10-11 12:19:40,429 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 12:19:40,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2024-10-11 12:19:40,430 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:40,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 74 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 12:19:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 12:19:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-10-11 12:19:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 12:19:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-10-11 12:19:40,440 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 45 [2024-10-11 12:19:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:40,441 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-11 12:19:40,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 12:19:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-10-11 12:19:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 12:19:40,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:40,443 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-11 12:19:40,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 12:19:40,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 12:19:40,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:40,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash 474539726, now seen corresponding path program 1 times [2024-10-11 12:19:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:40,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715316370] [2024-10-11 12:19:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:40,646 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-11 12:19:40,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:40,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 12:19:40,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:19:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:40,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 12:19:40,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 12:19:51,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:19:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 12:19:53,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:53,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715316370] [2024-10-11 12:19:53,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715316370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:19:53,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:19:53,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 12:19:53,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521551193] [2024-10-11 12:19:53,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:19:53,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 12:19:53,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:53,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 12:19:53,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:19:53,610 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 12:19:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:54,939 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-10-11 12:19:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 12:19:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2024-10-11 12:19:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:54,940 INFO L225 Difference]: With dead ends: 55 [2024-10-11 12:19:54,940 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:19:54,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2024-10-11 12:19:54,942 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:54,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 104 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 12:19:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:19:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:19:54,944 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-11 12:19:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:19:54,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-10-11 12:19:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:54,944 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:19:54,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 4 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 12:19:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:19:54,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:19:54,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:19:54,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:19:55,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 12:19:55,157 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:19:55,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:19:56,432 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:19:56,446 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:56,446 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:56,446 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:56,447 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:56,447 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:19:56,447 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:56,450 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:19:56,450 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:56,451 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:19:56,451 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:56,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:19:56 BoogieIcfgContainer [2024-10-11 12:19:56,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:19:56,454 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:19:56,454 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:19:56,454 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:19:56,455 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:21" (3/4) ... [2024-10-11 12:19:56,456 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:19:56,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:19:56,463 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 12:19:56,463 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-11 12:19:56,463 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:19:56,464 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:19:56,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:19:56,550 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:19:56,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:19:56,551 INFO L158 Benchmark]: Toolchain (without parser) took 35722.17ms. Allocated memory was 92.3MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 55.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-10-11 12:19:56,552 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 92.3MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:56,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.03ms. Allocated memory is still 92.3MB. Free memory was 55.7MB in the beginning and 69.7MB in the end (delta: -14.0MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-10-11 12:19:56,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.96ms. Allocated memory is still 92.3MB. Free memory was 69.7MB in the beginning and 68.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:56,553 INFO L158 Benchmark]: Boogie Preprocessor took 64.46ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 65.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:19:56,554 INFO L158 Benchmark]: RCFGBuilder took 459.15ms. Allocated memory is still 92.3MB. Free memory was 65.5MB in the beginning and 49.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:19:56,554 INFO L158 Benchmark]: TraceAbstraction took 34664.69ms. Allocated memory was 92.3MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 48.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2024-10-11 12:19:56,554 INFO L158 Benchmark]: Witness Printer took 96.54ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:19:56,556 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.12ms. Allocated memory is still 92.3MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.03ms. Allocated memory is still 92.3MB. Free memory was 55.7MB in the beginning and 69.7MB in the end (delta: -14.0MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.96ms. Allocated memory is still 92.3MB. Free memory was 69.7MB in the beginning and 68.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.46ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 65.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 459.15ms. Allocated memory is still 92.3MB. Free memory was 65.5MB in the beginning and 49.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34664.69ms. Allocated memory was 92.3MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 48.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. * Witness Printer took 96.54ms. Allocated memory is still 1.5GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~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: 33.3s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 417 IncrementalHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 75 mSDtfsCounter, 417 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=2, InterpolantAutomatonStates: 35, 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, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 220 ConstructedInterpolants, 2 QuantifiedInterpolants, 3808 SizeOfPredicates, 26 NumberOfNonLiveVariables, 247 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 328/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - 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) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:19:56,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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