./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.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 1f37f28e985fa9cd213de5b59fc80c1b7aa5c342cca2d3369965275ac128fee1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:13:37,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:13:37,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:13:37,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:13:37,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:13:37,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:13:37,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:13:37,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:13:37,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:13:37,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:13:37,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:13:37,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:13:37,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:13:37,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:13:37,600 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:13:37,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:13:37,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:13:37,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:13:37,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:13:37,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:13:37,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:13:37,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:13:37,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:13:37,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:13:37,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:13:37,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:13:37,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:13:37,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:13:37,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:13:37,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:13:37,606 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:13:37,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:13:37,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:37,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:13:37,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:13:37,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:13:37,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:13:37,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:13:37,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:13:37,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:13:37,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:13:37,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:13:37,610 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 -> 1f37f28e985fa9cd213de5b59fc80c1b7aa5c342cca2d3369965275ac128fee1 [2024-11-16 17:13:37,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:13:37,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:13:37,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:13:37,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:13:37,895 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:13:37,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i [2024-11-16 17:13:39,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:13:39,400 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:13:39,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i [2024-11-16 17:13:39,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a325464b9/3a1ce408716d40cbbfa05f71701a8d58/FLAG5d0280618 [2024-11-16 17:13:39,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a325464b9/3a1ce408716d40cbbfa05f71701a8d58 [2024-11-16 17:13:39,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:13:39,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:13:39,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:39,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:13:39,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:13:39,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc30534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39, skipping insertion in model container [2024-11-16 17:13:39,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:13:39,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i[914,927] [2024-11-16 17:13:39,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:39,592 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:13:39,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i[914,927] [2024-11-16 17:13:39,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:39,622 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:13:39,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39 WrapperNode [2024-11-16 17:13:39,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:39,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:39,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:13:39,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:13:39,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,686 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2024-11-16 17:13:39,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:39,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:13:39,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:13:39,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:13:39,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,730 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:13:39,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:13:39,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:13:39,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:13:39,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:13:39,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (1/1) ... [2024-11-16 17:13:39,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:39,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:13:39,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:13:39,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:13:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:13:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:13:39,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:13:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:13:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:13:39,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:13:39,954 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:13:39,959 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:13:40,142 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 17:13:40,144 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:13:40,155 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:13:40,157 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:13:40,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:40 BoogieIcfgContainer [2024-11-16 17:13:40,157 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:13:40,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:13:40,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:13:40,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:13:40,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:13:39" (1/3) ... [2024-11-16 17:13:40,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524c5363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:40, skipping insertion in model container [2024-11-16 17:13:40,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:39" (2/3) ... [2024-11-16 17:13:40,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@524c5363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:40, skipping insertion in model container [2024-11-16 17:13:40,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:40" (3/3) ... [2024-11-16 17:13:40,166 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-3.i [2024-11-16 17:13:40,181 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:13:40,181 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:13:40,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:13:40,248 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;@1b1923ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:13:40,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:13:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:13:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 17:13:40,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:40,262 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:13:40,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:40,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1752762559, now seen corresponding path program 1 times [2024-11-16 17:13:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:40,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900293600] [2024-11-16 17:13:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:40,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:13:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:40,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:13:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:13:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:13:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 17:13:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:40,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:13:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:40,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 17:13:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:40,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:13:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 17:13:40,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:13:40,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900293600] [2024-11-16 17:13:40,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900293600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:40,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:40,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:13:40,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288815705] [2024-11-16 17:13:40,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:40,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:13:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:13:40,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:13:40,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:40,500 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 17:13:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:40,521 INFO L93 Difference]: Finished difference Result 72 states and 111 transitions. [2024-11-16 17:13:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:13:40,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-11-16 17:13:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:40,531 INFO L225 Difference]: With dead ends: 72 [2024-11-16 17:13:40,532 INFO L226 Difference]: Without dead ends: 35 [2024-11-16 17:13:40,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:40,540 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:40,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:13:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-16 17:13:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-16 17:13:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:13:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-11-16 17:13:40,600 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 57 [2024-11-16 17:13:40,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:40,604 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-11-16 17:13:40,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 17:13:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-11-16 17:13:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 17:13:40,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:40,612 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:13:40,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:13:40,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1033109375, now seen corresponding path program 1 times [2024-11-16 17:13:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:13:40,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045447222] [2024-11-16 17:13:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:13:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:13:40,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:13:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:13:40,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:13:40,784 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:13:40,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:13:40,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:13:40,788 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 17:13:40,813 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:13:40,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:13:40 BoogieIcfgContainer [2024-11-16 17:13:40,816 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:13:40,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:13:40,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:13:40,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:13:40,817 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:40" (3/4) ... [2024-11-16 17:13:40,818 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:13:40,819 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:13:40,820 INFO L158 Benchmark]: Toolchain (without parser) took 1393.80ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 85.6MB in the beginning and 202.2MB in the end (delta: -116.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:40,820 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:40,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.00ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 72.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 17:13:40,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.89ms. Allocated memory is still 159.4MB. Free memory was 72.5MB in the beginning and 127.9MB in the end (delta: -55.4MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-11-16 17:13:40,821 INFO L158 Benchmark]: Boogie Preprocessor took 53.29ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 127.9MB in the beginning and 215.7MB in the end (delta: -87.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:13:40,821 INFO L158 Benchmark]: IcfgBuilder took 416.77ms. Allocated memory is still 243.3MB. Free memory was 215.7MB in the beginning and 201.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 17:13:40,822 INFO L158 Benchmark]: TraceAbstraction took 656.31ms. Allocated memory is still 243.3MB. Free memory was 201.0MB in the beginning and 202.2MB in the end (delta: -1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:40,822 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 243.3MB. Free memory is still 202.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:13:40,824 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.00ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 72.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.89ms. Allocated memory is still 159.4MB. Free memory was 72.5MB in the beginning and 127.9MB in the end (delta: -55.4MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.29ms. Allocated memory was 159.4MB in the beginning and 243.3MB in the end (delta: 83.9MB). Free memory was 127.9MB in the beginning and 215.7MB in the end (delta: -87.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 416.77ms. Allocated memory is still 243.3MB. Free memory was 215.7MB in the beginning and 201.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 656.31ms. Allocated memory is still 243.3MB. Free memory was 201.0MB in the beginning and 202.2MB in the end (delta: -1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 243.3MB. Free memory is still 202.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] float var_1_2 = 128.2; [L24] unsigned char var_1_3 = 1; [L25] float var_1_4 = 32.32; [L26] unsigned char var_1_5 = 0; [L27] signed short int var_1_6 = 64; VAL [isInitial=0, var_1_1=25, var_1_2=641/5, var_1_3=1, var_1_4=808/25, var_1_5=0, var_1_6=64] [L67] isInitial = 1 [L68] FCALL initially() [L69] COND TRUE 1 [L70] FCALL updateLastVariables() [L71] CALL updateVariables() [L46] var_1_2 = __VERIFIER_nondet_float() [L47] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=1, var_1_4=808/25, var_1_5=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=1, var_1_4=808/25, var_1_5=0, var_1_6=64] [L47] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=25, var_1_3=1, var_1_4=808/25, var_1_5=0, var_1_6=64] [L48] var_1_3 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_4=808/25, var_1_5=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_4=808/25, var_1_5=0, var_1_6=64] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=25, var_1_4=808/25, var_1_5=0, var_1_6=64] [L50] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_4=808/25, var_1_5=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_4=808/25, var_1_5=0, var_1_6=64] [L50] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_4=808/25, var_1_5=0, var_1_6=64] [L51] var_1_4 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=0, var_1_6=64] [L52] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=0, var_1_6=64] [L53] var_1_5 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_6=64] [L54] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_6=64] [L55] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=64] [L55] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=64] [L56] var_1_6 = __VERIFIER_nondet_short() [L57] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] [L57] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] [L58] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] [L58] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] [L71] RET updateVariables() [L72] CALL step() [L31] COND FALSE !(99999.8f < var_1_2) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] [L72] RET step() [L73] CALL, EXPR property() [L63-L64] return (99999.8f < var_1_2) ? ((! var_1_3) ? ((var_1_2 >= (var_1_4 / 2.5f)) ? (var_1_3 ? (var_1_5 ? (var_1_1 == ((signed short int) var_1_6)) : 1) : (var_1_1 == ((signed short int) var_1_6))) : 1) : 1) : 1 ; VAL [\result=0, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] [L73] RET, EXPR property() [L73] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] [L19] reach_error() VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 8, 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, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 47 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 56 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 17:13:40,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.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 1f37f28e985fa9cd213de5b59fc80c1b7aa5c342cca2d3369965275ac128fee1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:13:42,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:13:42,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:13:42,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:13:42,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:13:42,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:13:42,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:13:42,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:13:42,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:13:42,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:13:42,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:13:42,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:13:42,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:13:42,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:13:42,898 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:13:42,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:13:42,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:13:42,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:13:42,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:13:42,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:13:42,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:13:42,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:13:42,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:13:42,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:13:42,901 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:13:42,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:13:42,901 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:13:42,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:13:42,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:13:42,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:13:42,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:13:42,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:13:42,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:13:42,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:13:42,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:42,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:13:42,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:13:42,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:13:42,903 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:13:42,903 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:13:42,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:13:42,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:13:42,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:13:42,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:13:42,908 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 -> 1f37f28e985fa9cd213de5b59fc80c1b7aa5c342cca2d3369965275ac128fee1 [2024-11-16 17:13:43,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:13:43,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:13:43,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:13:43,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:13:43,239 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:13:43,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i [2024-11-16 17:13:44,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:13:44,892 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:13:44,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i [2024-11-16 17:13:44,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e75f50d/712dffeac83b47858b009aed79caec28/FLAG2a213c830 [2024-11-16 17:13:45,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e75f50d/712dffeac83b47858b009aed79caec28 [2024-11-16 17:13:45,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:13:45,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:13:45,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:45,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:13:45,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:13:45,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ebb549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45, skipping insertion in model container [2024-11-16 17:13:45,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:13:45,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i[914,927] [2024-11-16 17:13:45,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:45,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:13:45,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i[914,927] [2024-11-16 17:13:45,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:13:45,559 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:13:45,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45 WrapperNode [2024-11-16 17:13:45,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:13:45,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:45,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:13:45,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:13:45,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,598 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 69 [2024-11-16 17:13:45,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:13:45,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:13:45,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:13:45,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:13:45,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:13:45,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:13:45,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:13:45,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:13:45,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:13:45,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (1/1) ... [2024-11-16 17:13:45,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:13:45,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:13:45,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:13:45,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:13:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:13:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:13:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:13:45,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:13:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:13:45,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:13:45,795 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:13:45,801 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:13:46,557 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 17:13:46,557 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:13:46,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:13:46,570 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:13:46,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:46 BoogieIcfgContainer [2024-11-16 17:13:46,570 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:13:46,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:13:46,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:13:46,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:13:46,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:13:45" (1/3) ... [2024-11-16 17:13:46,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e31047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:46, skipping insertion in model container [2024-11-16 17:13:46,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:13:45" (2/3) ... [2024-11-16 17:13:46,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e31047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:13:46, skipping insertion in model container [2024-11-16 17:13:46,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:46" (3/3) ... [2024-11-16 17:13:46,587 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-3.i [2024-11-16 17:13:46,600 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:13:46,601 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:13:46,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:13:46,649 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;@2b84fc02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:13:46,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:13:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:13:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 17:13:46,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:46,663 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:13:46,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:46,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:46,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1752762559, now seen corresponding path program 1 times [2024-11-16 17:13:46,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707100146] [2024-11-16 17:13:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:46,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:13:46,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 17:13:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:46,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:13:46,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:13:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-16 17:13:46,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:13:46,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:13:46,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707100146] [2024-11-16 17:13:46,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707100146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:46,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:46,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:13:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175982330] [2024-11-16 17:13:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:46,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:13:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:13:46,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:13:46,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:46,902 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 17:13:46,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:46,923 INFO L93 Difference]: Finished difference Result 72 states and 111 transitions. [2024-11-16 17:13:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:13:46,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-11-16 17:13:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:46,931 INFO L225 Difference]: With dead ends: 72 [2024-11-16 17:13:46,932 INFO L226 Difference]: Without dead ends: 35 [2024-11-16 17:13:46,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:13:46,939 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:46,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:13:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-16 17:13:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-16 17:13:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:13:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-11-16 17:13:46,970 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 57 [2024-11-16 17:13:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:46,970 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-11-16 17:13:46,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 17:13:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-11-16 17:13:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 17:13:46,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:46,972 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:13:46,981 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 (2)] Forceful destruction successful, exit code 0 [2024-11-16 17:13:47,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:47,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:47,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1033109375, now seen corresponding path program 1 times [2024-11-16 17:13:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:47,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039561447] [2024-11-16 17:13:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:47,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:47,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:47,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:13:47,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 17:13:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:47,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 17:13:47,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:13:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 17:13:53,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:13:53,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:13:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039561447] [2024-11-16 17:13:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039561447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:13:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748866101] [2024-11-16 17:13:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:13:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:13:53,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:13:53,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:13:53,841 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:13:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:54,580 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-11-16 17:13:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:13:54,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-11-16 17:13:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:54,582 INFO L225 Difference]: With dead ends: 45 [2024-11-16 17:13:54,582 INFO L226 Difference]: Without dead ends: 42 [2024-11-16 17:13:54,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:13:54,584 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:54,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 166 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 17:13:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-16 17:13:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-16 17:13:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:13:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-16 17:13:54,589 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 57 [2024-11-16 17:13:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:54,590 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-16 17:13:54,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:13:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-16 17:13:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 17:13:54,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:54,592 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:13:54,598 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-11-16 17:13:54,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:54,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:54,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1676784893, now seen corresponding path program 1 times [2024-11-16 17:13:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:54,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152446811] [2024-11-16 17:13:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:54,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:54,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:54,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:13:54,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 17:13:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:54,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 17:13:54,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:13:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 17:13:57,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:13:57,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:13:57,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152446811] [2024-11-16 17:13:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152446811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:13:57,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:13:57,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:13:57,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323620707] [2024-11-16 17:13:57,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:13:57,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:13:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:13:57,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:13:57,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:13:57,958 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:13:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:13:59,517 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-11-16 17:13:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:13:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2024-11-16 17:13:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:13:59,519 INFO L225 Difference]: With dead ends: 52 [2024-11-16 17:13:59,522 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 17:13:59,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:13:59,523 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 21 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:13:59,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 203 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 17:13:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 17:13:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2024-11-16 17:13:59,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:13:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-16 17:13:59,533 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 58 [2024-11-16 17:13:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:13:59,539 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-16 17:13:59,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:13:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-16 17:13:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 17:13:59,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:13:59,540 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:13:59,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 17:13:59,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:59,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:13:59,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:13:59,742 INFO L85 PathProgramCache]: Analyzing trace with hash -273097021, now seen corresponding path program 1 times [2024-11-16 17:13:59,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:13:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473166936] [2024-11-16 17:13:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:13:59,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:13:59,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:13:59,748 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-11-16 17:13:59,750 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-11-16 17:13:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:13:59,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 17:13:59,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:14:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 17:14:02,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:14:02,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:14:02,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473166936] [2024-11-16 17:14:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473166936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:14:02,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:14:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 17:14:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001395794] [2024-11-16 17:14:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:14:02,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 17:14:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:14:02,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 17:14:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:14:02,564 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:14:10,291 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2024-11-16 17:14:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 17:14:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 59 [2024-11-16 17:14:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:14:10,300 INFO L225 Difference]: With dead ends: 90 [2024-11-16 17:14:10,300 INFO L226 Difference]: Without dead ends: 55 [2024-11-16 17:14:10,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:14:10,301 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:14:10,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 189 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-16 17:14:10,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-16 17:14:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2024-11-16 17:14:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 17:14:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-11-16 17:14:10,306 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 59 [2024-11-16 17:14:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:14:10,306 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-16 17:14:10,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-11-16 17:14:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 17:14:10,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:14:10,307 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:14:10,314 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-11-16 17:14:10,511 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-11-16 17:14:10,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:14:10,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:14:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash -675781664, now seen corresponding path program 1 times [2024-11-16 17:14:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:14:10,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061582096] [2024-11-16 17:14:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:14:10,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:14:10,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:14:10,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:14:10,518 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 (6)] Waiting until timeout for monitored process [2024-11-16 17:14:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:14:10,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 17:14:10,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:14:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-16 17:14:16,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:14:16,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:14:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061582096] [2024-11-16 17:14:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061582096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:14:16,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:14:16,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:14:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821975330] [2024-11-16 17:14:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:14:16,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:14:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:14:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:14:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:14:16,732 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:14:22,722 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-16 17:14:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:14:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 60 [2024-11-16 17:14:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:14:22,731 INFO L225 Difference]: With dead ends: 55 [2024-11-16 17:14:22,731 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 17:14:22,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:14:22,732 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 17:14:22,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 187 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 17:14:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 17:14:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 17:14:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 17:14:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 17:14:22,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2024-11-16 17:14:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:14:22,733 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 17:14:22,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-16 17:14:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 17:14:22,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 17:14:22,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:14:22,752 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 (6)] Ended with exit code 0 [2024-11-16 17:14:22,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:14:22,945 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 17:14:22,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 17:14:22,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:14:23,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:14:23 BoogieIcfgContainer [2024-11-16 17:14:23,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:14:23,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:14:23,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:14:23,004 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:14:23,008 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:13:46" (3/4) ... [2024-11-16 17:14:23,011 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 17:14:23,014 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 17:14:23,025 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-16 17:14:23,026 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-16 17:14:23,026 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 17:14:23,026 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 17:14:23,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 17:14:23,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 17:14:23,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:14:23,172 INFO L158 Benchmark]: Toolchain (without parser) took 37859.16ms. Allocated memory was 77.6MB in the beginning and 121.6MB in the end (delta: 44.0MB). Free memory was 39.9MB in the beginning and 52.1MB in the end (delta: -12.3MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-11-16 17:14:23,172 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 77.6MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:14:23,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.14ms. Allocated memory is still 77.6MB. Free memory was 39.6MB in the beginning and 49.9MB in the end (delta: -10.3MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-16 17:14:23,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.87ms. Allocated memory is still 77.6MB. Free memory was 49.9MB in the beginning and 48.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:14:23,173 INFO L158 Benchmark]: Boogie Preprocessor took 49.55ms. Allocated memory is still 77.6MB. Free memory was 48.2MB in the beginning and 46.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:14:23,173 INFO L158 Benchmark]: IcfgBuilder took 921.19ms. Allocated memory is still 77.6MB. Free memory was 46.1MB in the beginning and 33.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 17:14:23,173 INFO L158 Benchmark]: TraceAbstraction took 36421.53ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 79.1MB in the beginning and 56.3MB in the end (delta: 22.8MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2024-11-16 17:14:23,173 INFO L158 Benchmark]: Witness Printer took 167.57ms. Allocated memory is still 121.6MB. Free memory was 56.3MB in the beginning and 52.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 17:14:23,178 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.90ms. Allocated memory is still 77.6MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.14ms. Allocated memory is still 77.6MB. Free memory was 39.6MB in the beginning and 49.9MB in the end (delta: -10.3MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.87ms. Allocated memory is still 77.6MB. Free memory was 49.9MB in the beginning and 48.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.55ms. Allocated memory is still 77.6MB. Free memory was 48.2MB in the beginning and 46.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 921.19ms. Allocated memory is still 77.6MB. Free memory was 46.1MB in the beginning and 33.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 36421.53ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 79.1MB in the beginning and 56.3MB in the end (delta: 22.8MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * Witness Printer took 167.57ms. Allocated memory is still 121.6MB. Free memory was 56.3MB in the beginning and 52.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.3s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 792 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 547 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 245 mSDtfsCounter, 165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 396 SizeOfPredicates, 28 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 560/560 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: 69]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) RESULT: Ultimate proved your program to be correct! [2024-11-16 17:14:23,214 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