./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-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:17:51,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:17:51,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:17:51,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:17:51,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:17:51,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:17:51,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:17:51,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:17:51,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:17:51,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:17:51,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:17:51,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:17:51,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:17:51,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:17:51,500 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:17:51,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:17:51,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:17:51,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:17:51,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:17:51,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:17:51,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:17:51,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:17:51,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:17:51,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:17:51,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:17:51,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:17:51,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:17:51,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:17:51,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:17:51,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:17:51,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:17:51,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:17:51,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:17:51,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:17:51,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:17:51,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:17:51,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:17:51,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:17:51,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:17:51,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:17:51,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:17:51,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:17:51,511 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b [2024-10-24 10:17:51,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:17:51,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:17:51,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:17:51,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:17:51,824 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:17:51,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-10-24 10:17:53,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:17:53,495 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:17:53,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-10-24 10:17:53,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9894e9f/382fc0bfffd6464398098d51efc24cd9/FLAGb04420495 [2024-10-24 10:17:53,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9894e9f/382fc0bfffd6464398098d51efc24cd9 [2024-10-24 10:17:53,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:17:53,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:17:53,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:17:53,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:17:53,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:17:53,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:17:53" (1/1) ... [2024-10-24 10:17:53,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11cdce4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:53, skipping insertion in model container [2024-10-24 10:17:53,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:17:53" (1/1) ... [2024-10-24 10:17:53,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:17:54,059 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-12.i[915,928] [2024-10-24 10:17:54,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:17:54,111 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:17:54,124 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-12.i[915,928] [2024-10-24 10:17:54,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:17:54,155 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:17:54,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54 WrapperNode [2024-10-24 10:17:54,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:17:54,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:17:54,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:17:54,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:17:54,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,191 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 68 [2024-10-24 10:17:54,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:17:54,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:17:54,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:17:54,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:17:54,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,226 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:17:54,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:17:54,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:17:54,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:17:54,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:17:54,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (1/1) ... [2024-10-24 10:17:54,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:17:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:17:54,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:17:54,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:17:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:17:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:17:54,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:17:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:17:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:17:54,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:17:54,403 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:17:54,405 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:17:54,585 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 10:17:54,585 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:17:54,644 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:17:54,644 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:17:54,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:17:54 BoogieIcfgContainer [2024-10-24 10:17:54,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:17:54,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:17:54,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:17:54,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:17:54,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:17:53" (1/3) ... [2024-10-24 10:17:54,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d75cad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:17:54, skipping insertion in model container [2024-10-24 10:17:54,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:17:54" (2/3) ... [2024-10-24 10:17:54,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d75cad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:17:54, skipping insertion in model container [2024-10-24 10:17:54,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:17:54" (3/3) ... [2024-10-24 10:17:54,655 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-12.i [2024-10-24 10:17:54,670 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:17:54,670 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:17:54,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:17:54,739 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;@6d451a40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:17:54,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:17:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:17:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 10:17:54,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:17:54,754 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:17:54,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:17:54,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:17:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2136870077, now seen corresponding path program 1 times [2024-10-24 10:17:54,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:17:54,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698071670] [2024-10-24 10:17:54,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:17:54,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:17:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:17:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:17:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:17:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:17:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:17:54,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:17:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:17:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:17:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:17:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:17:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:17:55,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:17:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:17:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:17:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:17:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698071670] [2024-10-24 10:17:55,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698071670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:17:55,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:17:55,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:17:55,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355080687] [2024-10-24 10:17:55,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:17:55,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:17:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:17:55,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:17:55,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:17:55,037 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 10:17:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:17:55,066 INFO L93 Difference]: Finished difference Result 43 states and 68 transitions. [2024-10-24 10:17:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:17:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2024-10-24 10:17:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:17:55,075 INFO L225 Difference]: With dead ends: 43 [2024-10-24 10:17:55,075 INFO L226 Difference]: Without dead ends: 21 [2024-10-24 10:17:55,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:17:55,082 INFO L432 NwaCegarLoop]: 24 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, 24 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:17:55,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:17:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-24 10:17:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-24 10:17:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:17:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-10-24 10:17:55,119 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 39 [2024-10-24 10:17:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:17:55,119 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-24 10:17:55,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 10:17:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-10-24 10:17:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 10:17:55,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:17:55,122 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:17:55,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:17:55,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:17:55,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:17:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1882385917, now seen corresponding path program 1 times [2024-10-24 10:17:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:17:55,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147611103] [2024-10-24 10:17:55,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:17:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:17:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:17:55,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:17:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:17:55,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:17:55,289 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:17:55,291 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:17:55,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:17:55,296 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 10:17:55,352 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:17:55,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:17:55 BoogieIcfgContainer [2024-10-24 10:17:55,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:17:55,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:17:55,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:17:55,357 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:17:55,358 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:17:54" (3/4) ... [2024-10-24 10:17:55,360 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:17:55,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:17:55,362 INFO L158 Benchmark]: Toolchain (without parser) took 1508.54ms. Allocated memory was 153.1MB in the beginning and 213.9MB in the end (delta: 60.8MB). Free memory was 122.6MB in the beginning and 182.4MB in the end (delta: -59.8MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2024-10-24 10:17:55,363 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:17:55,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.88ms. Allocated memory is still 153.1MB. Free memory was 122.6MB in the beginning and 109.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:17:55,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.88ms. Allocated memory is still 153.1MB. Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:17:55,364 INFO L158 Benchmark]: Boogie Preprocessor took 45.00ms. Allocated memory is still 153.1MB. Free memory was 107.6MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:17:55,364 INFO L158 Benchmark]: RCFGBuilder took 407.85ms. Allocated memory is still 153.1MB. Free memory was 105.6MB in the beginning and 91.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:17:55,365 INFO L158 Benchmark]: TraceAbstraction took 708.28ms. Allocated memory was 153.1MB in the beginning and 213.9MB in the end (delta: 60.8MB). Free memory was 90.3MB in the beginning and 182.4MB in the end (delta: -92.0MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2024-10-24 10:17:55,365 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 213.9MB. Free memory is still 182.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:17:55,369 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.18ms. Allocated memory is still 153.1MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.88ms. Allocated memory is still 153.1MB. Free memory was 122.6MB in the beginning and 109.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.88ms. Allocated memory is still 153.1MB. Free memory was 109.7MB in the beginning and 107.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.00ms. Allocated memory is still 153.1MB. Free memory was 107.6MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.85ms. Allocated memory is still 153.1MB. Free memory was 105.6MB in the beginning and 91.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 708.28ms. Allocated memory was 153.1MB in the beginning and 213.9MB in the end (delta: 60.8MB). Free memory was 90.3MB in the beginning and 182.4MB in the end (delta: -92.0MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 213.9MB. Free memory is still 182.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 4; [L23] signed char var_1_4 = -1; [L24] signed char var_1_5 = 100; [L25] signed long int var_1_6 = 1000; [L26] double var_1_7 = 4.5; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 0; [L29] signed long int var_1_10 = 256; [L30] signed char last_1_var_1_1 = 4; [L62] isInitial = 1 [L63] FCALL initially() [L64] COND TRUE 1 [L65] CALL updateLastVariables() [L55] last_1_var_1_1 = var_1_1 [L65] RET updateLastVariables() [L66] CALL updateVariables() [L44] var_1_4 = __VERIFIER_nondet_char() [L45] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L45] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L46] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L46] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L47] var_1_5 = __VERIFIER_nondet_char() [L48] CALL assume_abort_if_not(var_1_5 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L48] RET assume_abort_if_not(var_1_5 >= -126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L49] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L49] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L50] var_1_9 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L51] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L52] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L52] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L66] RET updateVariables() [L67] CALL step() [L34] var_1_7 = 199.5 [L35] var_1_8 = var_1_9 [L36] var_1_10 = var_1_5 [L37] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, last_1_var_1_1=4, stepLocal_0=125, var_1_10=125, var_1_1=4, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=399/2, var_1_8=0, var_1_9=0] [L38] COND TRUE stepLocal_0 >= last_1_var_1_1 [L39] var_1_1 = (((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) < 0 ) ? -((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) : ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=125, var_1_1=125, var_1_4=126, var_1_5=125, var_1_6=1000, var_1_7=399/2, var_1_8=0, var_1_9=0] [L41] var_1_6 = ((((var_1_4) > (var_1_1)) ? (var_1_4) : (var_1_1))) [L67] RET step() [L68] CALL, EXPR property() [L58-L59] return (((((var_1_10 >= last_1_var_1_1) ? (var_1_1 == ((signed char) (((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) < 0 ) ? -((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) : ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) : 1) && (var_1_6 == ((signed long int) ((((var_1_4) > (var_1_1)) ? (var_1_4) : (var_1_1)))))) && (var_1_7 == ((double) 199.5))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((signed long int) var_1_5)) ; [L68] RET, EXPR property() [L68] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=125, var_1_1=125, var_1_4=126, var_1_5=125, var_1_6=126, var_1_7=399/2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=4, var_1_10=125, var_1_1=125, var_1_4=126, var_1_5=125, var_1_6=126, var_1_7=399/2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 6, 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, 24 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, 24 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 38 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 60/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:17:55,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:17:57,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:17:57,821 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:17:57,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:17:57,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:17:57,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:17:57,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:17:57,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:17:57,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:17:57,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:17:57,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:17:57,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:17:57,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:17:57,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:17:57,867 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:17:57,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:17:57,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:17:57,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:17:57,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:17:57,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:17:57,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:17:57,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:17:57,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:17:57,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:17:57,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:17:57,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:17:57,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:17:57,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:17:57,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:17:57,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:17:57,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:17:57,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:17:57,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:17:57,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:17:57,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:17:57,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:17:57,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:17:57,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:17:57,878 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:17:57,878 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:17:57,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:17:57,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:17:57,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:17:57,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:17:57,880 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:17:57,880 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b [2024-10-24 10:17:58,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:17:58,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:17:58,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:17:58,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:17:58,257 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:17:58,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-10-24 10:17:59,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:17:59,969 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:17:59,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-10-24 10:17:59,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706b54fa2/fba172f3325e4550ac3ef9051f524bb7/FLAG07f8d3fa7 [2024-10-24 10:18:00,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706b54fa2/fba172f3325e4550ac3ef9051f524bb7 [2024-10-24 10:18:00,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:18:00,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:18:00,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:00,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:18:00,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:18:00,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7755d9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00, skipping insertion in model container [2024-10-24 10:18:00,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:18:00,236 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-12.i[915,928] [2024-10-24 10:18:00,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:00,293 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:18:00,305 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-12.i[915,928] [2024-10-24 10:18:00,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:00,343 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:18:00,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00 WrapperNode [2024-10-24 10:18:00,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:00,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:00,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:18:00,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:18:00,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,389 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 66 [2024-10-24 10:18:00,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:00,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:18:00,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:18:00,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:18:00,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,422 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:18:00,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:18:00,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:18:00,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:18:00,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:18:00,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (1/1) ... [2024-10-24 10:18:00,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:00,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:18:00,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:18:00,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:18:00,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:18:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:18:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:18:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:18:00,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:18:00,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:18:00,585 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:18:00,587 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:18:00,789 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 10:18:00,790 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:18:00,846 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:18:00,846 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:18:00,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:00 BoogieIcfgContainer [2024-10-24 10:18:00,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:18:00,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:18:00,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:18:00,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:18:00,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:18:00" (1/3) ... [2024-10-24 10:18:00,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0d02ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:00, skipping insertion in model container [2024-10-24 10:18:00,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:00" (2/3) ... [2024-10-24 10:18:00,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0d02ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:00, skipping insertion in model container [2024-10-24 10:18:00,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:00" (3/3) ... [2024-10-24 10:18:00,857 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-12.i [2024-10-24 10:18:00,873 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:18:00,874 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:18:00,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:18:00,944 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;@6f36229b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:18:00,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:18:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:18:00,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 10:18:00,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:00,958 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:00,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:00,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2136870077, now seen corresponding path program 1 times [2024-10-24 10:18:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:00,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977724987] [2024-10-24 10:18:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:00,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:00,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:18:00,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:18:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:01,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:18:01,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-24 10:18:01,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:01,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977724987] [2024-10-24 10:18:01,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977724987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:01,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:01,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:18:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779039290] [2024-10-24 10:18:01,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:01,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:18:01,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:01,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:18:01,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:01,151 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:01,184 INFO L93 Difference]: Finished difference Result 43 states and 68 transitions. [2024-10-24 10:18:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:18:01,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2024-10-24 10:18:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:01,196 INFO L225 Difference]: With dead ends: 43 [2024-10-24 10:18:01,196 INFO L226 Difference]: Without dead ends: 21 [2024-10-24 10:18:01,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:01,202 INFO L432 NwaCegarLoop]: 24 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, 24 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:01,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:18:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-24 10:18:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-24 10:18:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:18:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-10-24 10:18:01,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 39 [2024-10-24 10:18:01,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:01,245 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-24 10:18:01,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-10-24 10:18:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 10:18:01,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:01,248 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:01,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 10:18:01,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:01,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:01,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1882385917, now seen corresponding path program 1 times [2024-10-24 10:18:01,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:01,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529421996] [2024-10-24 10:18:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:01,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:01,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:01,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:18:01,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:18:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:01,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 10:18:01,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:18:07,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:07,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:07,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529421996] [2024-10-24 10:18:07,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529421996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:07,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:18:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446713447] [2024-10-24 10:18:07,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:07,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:18:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:07,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:18:07,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:18:07,732 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:07,867 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-10-24 10:18:07,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:18:07,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2024-10-24 10:18:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:07,870 INFO L225 Difference]: With dead ends: 35 [2024-10-24 10:18:07,870 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 10:18:07,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:18:07,872 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:07,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 86 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 10:18:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-10-24 10:18:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:18:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-24 10:18:07,882 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 39 [2024-10-24 10:18:07,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:07,883 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-24 10:18:07,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-24 10:18:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 10:18:07,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:07,885 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:07,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 10:18:08,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:08,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:08,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1882326335, now seen corresponding path program 1 times [2024-10-24 10:18:08,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930857360] [2024-10-24 10:18:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:08,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:08,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:08,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:18:08,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:18:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:08,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:18:08,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:18:10,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:10,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930857360] [2024-10-24 10:18:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930857360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:10,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:10,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:18:10,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360330608] [2024-10-24 10:18:10,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:10,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:18:10,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:10,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:18:10,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:18:10,937 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:11,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:11,092 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-10-24 10:18:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:18:11,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2024-10-24 10:18:11,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:11,094 INFO L225 Difference]: With dead ends: 55 [2024-10-24 10:18:11,094 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 10:18:11,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:18:11,095 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:11,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 10:18:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-10-24 10:18:11,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:18:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-10-24 10:18:11,108 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 39 [2024-10-24 10:18:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:11,108 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-10-24 10:18:11,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2024-10-24 10:18:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 10:18:11,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:11,111 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:11,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 10:18:11,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:11,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:11,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash -411852039, now seen corresponding path program 1 times [2024-10-24 10:18:11,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:11,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125265708] [2024-10-24 10:18:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:11,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:11,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:11,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:18:11,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 10:18:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:11,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 10:18:11,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-24 10:18:13,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:13,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:13,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125265708] [2024-10-24 10:18:13,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125265708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:13,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:13,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:18:13,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326581448] [2024-10-24 10:18:13,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:13,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:18:13,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:13,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:18:13,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:18:13,107 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:13,193 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-10-24 10:18:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:18:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2024-10-24 10:18:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:13,195 INFO L225 Difference]: With dead ends: 54 [2024-10-24 10:18:13,195 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:18:13,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:18:13,197 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:13,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:18:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:18:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 10:18:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:18:13,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2024-10-24 10:18:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:13,199 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:18:13,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:18:13,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:18:13,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:18:13,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 10:18:13,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:13,406 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 10:18:13,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:18:13,589 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:18:13,599 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:18:13,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:18:13 BoogieIcfgContainer [2024-10-24 10:18:13,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:18:13,613 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:18:13,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:18:13,615 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:18:13,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:00" (3/4) ... [2024-10-24 10:18:13,617 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:18:13,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:18:13,625 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-24 10:18:13,625 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 10:18:13,625 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:18:13,626 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:18:13,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:18:13,729 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:18:13,730 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:18:13,730 INFO L158 Benchmark]: Toolchain (without parser) took 13725.66ms. Allocated memory was 65.0MB in the beginning and 650.1MB in the end (delta: 585.1MB). Free memory was 32.3MB in the beginning and 472.5MB in the end (delta: -440.2MB). Peak memory consumption was 143.9MB. Max. memory is 16.1GB. [2024-10-24 10:18:13,730 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 52.4MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:13,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.12ms. Allocated memory is still 65.0MB. Free memory was 32.1MB in the beginning and 34.3MB in the end (delta: -2.2MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-10-24 10:18:13,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.77ms. Allocated memory is still 65.0MB. Free memory was 34.3MB in the beginning and 32.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:13,731 INFO L158 Benchmark]: Boogie Preprocessor took 44.89ms. Allocated memory is still 65.0MB. Free memory was 32.5MB in the beginning and 30.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:13,731 INFO L158 Benchmark]: RCFGBuilder took 409.62ms. Allocated memory is still 65.0MB. Free memory was 30.2MB in the beginning and 34.7MB in the end (delta: -4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:18:13,731 INFO L158 Benchmark]: TraceAbstraction took 12763.05ms. Allocated memory was 65.0MB in the beginning and 650.1MB in the end (delta: 585.1MB). Free memory was 34.1MB in the beginning and 477.7MB in the end (delta: -443.6MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2024-10-24 10:18:13,732 INFO L158 Benchmark]: Witness Printer took 116.63ms. Allocated memory is still 650.1MB. Free memory was 477.7MB in the beginning and 472.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:18:13,734 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 52.4MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.12ms. Allocated memory is still 65.0MB. Free memory was 32.1MB in the beginning and 34.3MB in the end (delta: -2.2MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.77ms. Allocated memory is still 65.0MB. Free memory was 34.3MB in the beginning and 32.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.89ms. Allocated memory is still 65.0MB. Free memory was 32.5MB in the beginning and 30.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.62ms. Allocated memory is still 65.0MB. Free memory was 30.2MB in the beginning and 34.7MB in the end (delta: -4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12763.05ms. Allocated memory was 65.0MB in the beginning and 650.1MB in the end (delta: 585.1MB). Free memory was 34.1MB in the beginning and 477.7MB in the end (delta: -443.6MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * Witness Printer took 116.63ms. Allocated memory is still 650.1MB. Free memory was 477.7MB in the beginning and 472.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode * 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 267 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 106 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 SizeOfPredicates, 30 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 457/457 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: 64]: Loop Invariant Derived loop invariant: (((var_1_1 == 4) && (4 == last_1_var_1_1)) || ((var_1_5 == var_1_10) && (var_1_8 == var_1_9))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:18:13,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE