./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.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 942fc1721d9d68198092543c6d2644725032e77c472db86e1b213e7c4933ab1c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:33:24,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:33:24,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 11:33:24,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:33:24,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:33:24,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:33:24,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:33:24,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:33:24,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:33:24,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:33:24,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:33:24,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:33:24,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:33:24,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:33:24,989 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:33:24,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:33:24,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:33:24,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:33:24,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 11:33:24,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:33:24,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:33:24,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:33:24,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:33:24,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:33:24,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:33:24,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:33:24,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:33:24,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:33:24,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:33:24,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:33:24,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:33:24,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:33:24,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:33:24,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:33:24,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:33:24,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:33:24,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 11:33:24,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 11:33:24,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:33:24,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:33:24,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:33:24,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:33:24,995 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 -> 942fc1721d9d68198092543c6d2644725032e77c472db86e1b213e7c4933ab1c [2024-11-22 11:33:25,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:33:25,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:33:25,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:33:25,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:33:25,204 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:33:25,205 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-25.i [2024-11-22 11:33:26,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:33:26,558 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:33:26,559 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i [2024-11-22 11:33:26,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0313d9686/b572437c098544b18a8377eb1aa14e54/FLAG13f151176 [2024-11-22 11:33:26,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0313d9686/b572437c098544b18a8377eb1aa14e54 [2024-11-22 11:33:26,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:33:26,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:33:26,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:33:26,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:33:26,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:33:26,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1635e0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26, skipping insertion in model container [2024-11-22 11:33:26,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:33:26,730 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-25.i[915,928] [2024-11-22 11:33:26,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:33:26,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:33:26,774 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-25.i[915,928] [2024-11-22 11:33:26,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:33:26,793 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:33:26,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26 WrapperNode [2024-11-22 11:33:26,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:33:26,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:33:26,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:33:26,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:33:26,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,823 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2024-11-22 11:33:26,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:33:26,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:33:26,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:33:26,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:33:26,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,841 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-22 11:33:26,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:33:26,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:33:26,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:33:26,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:33:26,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (1/1) ... [2024-11-22 11:33:26,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:33:26,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:33:26,885 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-22 11:33:26,888 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-22 11:33:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:33:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:33:26,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:33:26,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 11:33:26,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:33:26,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:33:26,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:33:26,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:33:27,136 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 11:33:27,137 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:33:27,149 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:33:27,149 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:33:27,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:27 BoogieIcfgContainer [2024-11-22 11:33:27,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:33:27,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:33:27,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:33:27,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:33:27,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:33:26" (1/3) ... [2024-11-22 11:33:27,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325d8d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:33:27, skipping insertion in model container [2024-11-22 11:33:27,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:26" (2/3) ... [2024-11-22 11:33:27,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325d8d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:33:27, skipping insertion in model container [2024-11-22 11:33:27,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:27" (3/3) ... [2024-11-22 11:33:27,158 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-25.i [2024-11-22 11:33:27,171 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:33:27,171 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:33:27,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:33:27,231 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;@47206745, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:33:27,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:33:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 11:33:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 11:33:27,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:27,245 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:33:27,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:27,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash 941058505, now seen corresponding path program 1 times [2024-11-22 11:33:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:33:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005035718] [2024-11-22 11:33:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:33:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-22 11:33:27,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:33:27,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005035718] [2024-11-22 11:33:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005035718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:33:27,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823967196] [2024-11-22 11:33:27,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:27,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:33:27,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:33:27,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:33:27,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 11:33:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:27,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:33:27,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-22 11:33:27,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:27,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823967196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:27,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:33:27,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 11:33:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319873332] [2024-11-22 11:33:27,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:27,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:33:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:33:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:33:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:33:27,582 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-22 11:33:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:27,595 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2024-11-22 11:33:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:33:27,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-22 11:33:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:27,601 INFO L225 Difference]: With dead ends: 59 [2024-11-22 11:33:27,601 INFO L226 Difference]: Without dead ends: 29 [2024-11-22 11:33:27,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 45 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-22 11:33:27,606 INFO L432 NwaCegarLoop]: 38 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, 38 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-22 11:33:27,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:33:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-22 11:33:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-22 11:33:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 11:33:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-22 11:33:27,635 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 44 [2024-11-22 11:33:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:27,636 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-22 11:33:27,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-22 11:33:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-22 11:33:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 11:33:27,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:27,639 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:33:27,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 11:33:27,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 11:33:27,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1760285773, now seen corresponding path program 1 times [2024-11-22 11:33:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:33:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173867136] [2024-11-22 11:33:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:33:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:33:27,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 11:33:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:33:27,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 11:33:27,938 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 11:33:27,939 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 11:33:27,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 11:33:27,942 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 11:33:27,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 11:33:27,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:33:27 BoogieIcfgContainer [2024-11-22 11:33:27,977 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 11:33:27,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 11:33:27,978 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 11:33:27,978 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 11:33:27,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:27" (3/4) ... [2024-11-22 11:33:27,980 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 11:33:27,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 11:33:27,983 INFO L158 Benchmark]: Toolchain (without parser) took 1403.43ms. Allocated memory is still 192.9MB. Free memory was 126.0MB in the beginning and 142.5MB in the end (delta: -16.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:33:27,985 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:33:27,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.80ms. Allocated memory is still 192.9MB. Free memory was 125.7MB in the beginning and 112.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 11:33:27,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.49ms. Allocated memory is still 192.9MB. Free memory was 112.8MB in the beginning and 111.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:33:27,986 INFO L158 Benchmark]: Boogie Preprocessor took 30.14ms. Allocated memory is still 192.9MB. Free memory was 111.0MB in the beginning and 108.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:33:27,986 INFO L158 Benchmark]: RCFGBuilder took 295.74ms. Allocated memory is still 192.9MB. Free memory was 108.9MB in the beginning and 96.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 11:33:27,987 INFO L158 Benchmark]: TraceAbstraction took 824.98ms. Allocated memory is still 192.9MB. Free memory was 95.7MB in the beginning and 143.5MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:33:27,989 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 192.9MB. Free memory was 143.5MB in the beginning and 142.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:33:27,990 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.13ms. Allocated memory is still 121.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.80ms. Allocated memory is still 192.9MB. Free memory was 125.7MB in the beginning and 112.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.49ms. Allocated memory is still 192.9MB. Free memory was 112.8MB in the beginning and 111.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.14ms. Allocated memory is still 192.9MB. Free memory was 111.0MB in the beginning and 108.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 295.74ms. Allocated memory is still 192.9MB. Free memory was 108.9MB in the beginning and 96.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 824.98ms. Allocated memory is still 192.9MB. Free memory was 95.7MB in the beginning and 143.5MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 192.9MB. Free memory was 143.5MB in the beginning and 142.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.742; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] double var_1_4 = 1.625; [L26] double var_1_5 = 8.25; VAL [isInitial=0, var_1_1=371/500, var_1_2=1, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=371/500, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L50] var_1_3 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_4=13/8, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_4=13/8, var_1_5=33/4] [L51] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_4=13/8, var_1_5=33/4] [L52] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_4=13/8, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_4=13/8, var_1_5=33/4] [L52] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_4=13/8, var_1_5=33/4] [L53] var_1_4 = __VERIFIER_nondet_double() [L54] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_5=33/4] [L54] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_5=33/4] [L55] var_1_5 = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1] [L56] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1] [L69] RET updateVariables() [L70] CALL step() [L30] COND FALSE !(\read(var_1_2)) [L43] var_1_1 = var_1_5 VAL [isInitial=1, var_1_1=53, var_1_2=0, var_1_3=1, var_1_5=53] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return var_1_2 ? ((! var_1_3) ? (var_1_3 ? (var_1_1 == ((double) ((((var_1_4) < (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) ? (var_1_4) : (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))))) : 1) : ((var_1_5 <= var_1_4) ? (var_1_1 == ((double) var_1_4)) : (var_1_1 == ((double) 199.5)))) : (var_1_1 == ((double) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_1=53, var_1_2=0, var_1_3=1, var_1_5=53] [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=53, var_1_2=0, var_1_3=1, var_1_5=53] [L19] reach_error() VAL [isInitial=1, var_1_1=53, var_1_2=0, var_1_3=1, var_1_5=53] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 38 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, 38 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 86 SizeOfPredicates, 0 NumberOfNonLiveVariables, 113 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 110/120 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-22 11:33:28,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.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 942fc1721d9d68198092543c6d2644725032e77c472db86e1b213e7c4933ab1c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:33:29,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:33:29,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 11:33:29,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:33:29,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:33:29,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:33:29,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:33:29,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:33:29,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:33:29,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:33:29,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:33:29,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:33:29,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:33:29,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:33:29,874 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:33:29,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:33:29,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:33:29,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:33:29,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:33:29,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:33:29,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:33:29,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:33:29,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:33:29,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 11:33:29,880 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 11:33:29,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:33:29,880 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 11:33:29,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:33:29,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:33:29,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:33:29,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:33:29,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:33:29,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:33:29,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:33:29,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:33:29,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:33:29,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:33:29,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:33:29,888 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 11:33:29,888 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 11:33:29,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:33:29,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:33:29,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:33:29,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:33:29,889 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 -> 942fc1721d9d68198092543c6d2644725032e77c472db86e1b213e7c4933ab1c [2024-11-22 11:33:30,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:33:30,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:33:30,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:33:30,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:33:30,168 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:33:30,169 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-25.i [2024-11-22 11:33:31,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:33:31,623 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:33:31,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i [2024-11-22 11:33:31,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e38208cd/6cdf59433fe0461aba60d73a1ff86b6e/FLAGa8cecd1db [2024-11-22 11:33:31,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e38208cd/6cdf59433fe0461aba60d73a1ff86b6e [2024-11-22 11:33:31,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:33:31,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:33:31,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:33:31,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:33:31,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:33:31,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:31,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10df84d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31, skipping insertion in model container [2024-11-22 11:33:31,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:31,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:33:31,823 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-25.i[915,928] [2024-11-22 11:33:31,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:33:31,863 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:33:31,873 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-25.i[915,928] [2024-11-22 11:33:31,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:33:31,910 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:33:31,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31 WrapperNode [2024-11-22 11:33:31,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:33:31,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:33:31,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:33:31,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:33:31,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:31,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:31,960 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2024-11-22 11:33:31,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:33:31,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:33:31,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:33:31,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:33:31,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:31,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:31,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:31,987 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-22 11:33:31,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:31,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:31,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:32,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:32,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:32,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:32,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:33:32,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:33:32,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:33:32,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:33:32,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (1/1) ... [2024-11-22 11:33:32,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:33:32,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:33:32,044 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-22 11:33:32,046 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-22 11:33:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:33:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 11:33:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:33:32,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:33:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:33:32,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:33:32,149 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:33:32,151 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:33:32,321 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 11:33:32,322 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:33:32,334 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:33:32,335 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:33:32,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:32 BoogieIcfgContainer [2024-11-22 11:33:32,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:33:32,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:33:32,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:33:32,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:33:32,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:33:31" (1/3) ... [2024-11-22 11:33:32,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a7168f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:33:32, skipping insertion in model container [2024-11-22 11:33:32,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:33:31" (2/3) ... [2024-11-22 11:33:32,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a7168f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:33:32, skipping insertion in model container [2024-11-22 11:33:32,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:32" (3/3) ... [2024-11-22 11:33:32,345 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-25.i [2024-11-22 11:33:32,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:33:32,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:33:32,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:33:32,416 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;@49a3b676, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:33:32,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:33:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 11:33:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 11:33:32,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:32,426 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:33:32,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:32,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 941058505, now seen corresponding path program 1 times [2024-11-22 11:33:32,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:32,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360685217] [2024-11-22 11:33:32,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:32,442 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-22 11:33:32,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:32,460 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-22 11:33:32,461 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-22 11:33:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:32,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:33:32,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-22 11:33:32,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:32,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:32,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360685217] [2024-11-22 11:33:32,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360685217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:32,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:33:32,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 11:33:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150797852] [2024-11-22 11:33:32,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:32,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:33:32,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:32,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:33:32,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:33:32,653 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-22 11:33:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:32,670 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2024-11-22 11:33:32,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:33:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-22 11:33:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:32,676 INFO L225 Difference]: With dead ends: 59 [2024-11-22 11:33:32,677 INFO L226 Difference]: Without dead ends: 29 [2024-11-22 11:33:32,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 43 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-22 11:33:32,681 INFO L432 NwaCegarLoop]: 38 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, 38 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-22 11:33:32,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:33:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-22 11:33:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-22 11:33:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 11:33:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-22 11:33:32,710 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 44 [2024-11-22 11:33:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:32,710 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-22 11:33:32,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-22 11:33:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-22 11:33:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 11:33:32,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:32,712 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:33:32,717 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-22 11:33:32,913 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-22 11:33:32,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:32,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1760285773, now seen corresponding path program 1 times [2024-11-22 11:33:32,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:32,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126317290] [2024-11-22 11:33:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:32,915 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-22 11:33:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:32,917 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-22 11:33:32,918 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-22 11:33:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:32,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 11:33:32,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-22 11:33:36,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:36,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:36,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126317290] [2024-11-22 11:33:36,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126317290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:36,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:33:36,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 11:33:36,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503837759] [2024-11-22 11:33:36,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:36,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 11:33:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:36,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 11:33:36,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 11:33:36,833 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:37,316 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-22 11:33:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 11:33:37,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-11-22 11:33:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:37,318 INFO L225 Difference]: With dead ends: 43 [2024-11-22 11:33:37,318 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 11:33:37,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-22 11:33:37,319 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 11:33:37,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 121 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 11:33:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 11:33:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2024-11-22 11:33:37,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 11:33:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-22 11:33:37,332 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 44 [2024-11-22 11:33:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:37,332 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-22 11:33:37,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-22 11:33:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 11:33:37,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:37,334 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:33:37,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 11:33:37,535 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-22 11:33:37,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:37,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash -796364099, now seen corresponding path program 1 times [2024-11-22 11:33:37,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:37,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867804819] [2024-11-22 11:33:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:37,538 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-22 11:33:37,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:37,540 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-22 11:33:37,541 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-22 11:33:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:37,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 11:33:37,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-22 11:33:37,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:37,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:37,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867804819] [2024-11-22 11:33:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867804819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:37,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:33:37,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 11:33:37,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976594491] [2024-11-22 11:33:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:37,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 11:33:37,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:37,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 11:33:37,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:33:37,613 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:37,638 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2024-11-22 11:33:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 11:33:37,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-11-22 11:33:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:37,640 INFO L225 Difference]: With dead ends: 84 [2024-11-22 11:33:37,640 INFO L226 Difference]: Without dead ends: 51 [2024-11-22 11:33:37,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:33:37,642 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:33:37,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 66 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:33:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-22 11:33:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-22 11:33:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 11:33:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2024-11-22 11:33:37,648 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 46 [2024-11-22 11:33:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:37,648 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2024-11-22 11:33:37,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-11-22 11:33:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 11:33:37,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:37,649 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:33:37,655 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-22 11:33:37,850 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-22 11:33:37,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:37,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash -794517057, now seen corresponding path program 1 times [2024-11-22 11:33:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:37,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734332781] [2024-11-22 11:33:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:37,851 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-22 11:33:37,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:37,854 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-22 11:33:37,855 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-22 11:33:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:37,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 11:33:37,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-22 11:33:39,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:39,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:39,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734332781] [2024-11-22 11:33:39,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734332781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:39,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:33:39,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 11:33:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435809470] [2024-11-22 11:33:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:39,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 11:33:39,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:39,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 11:33:39,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 11:33:39,277 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:39,354 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-11-22 11:33:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 11:33:39,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-11-22 11:33:39,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:39,356 INFO L225 Difference]: With dead ends: 53 [2024-11-22 11:33:39,356 INFO L226 Difference]: Without dead ends: 51 [2024-11-22 11:33:39,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 11:33:39,357 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 11:33:39,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 151 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 11:33:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-22 11:33:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-22 11:33:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 11:33:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-22 11:33:39,362 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 46 [2024-11-22 11:33:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:39,363 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-22 11:33:39,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-22 11:33:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 11:33:39,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:39,364 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:33:39,371 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 (5)] Ended with exit code 0 [2024-11-22 11:33:39,564 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-22 11:33:39,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:39,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash -559942723, now seen corresponding path program 1 times [2024-11-22 11:33:39,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:39,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446794973] [2024-11-22 11:33:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:39,565 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-22 11:33:39,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:39,566 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-22 11:33:39,568 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-22 11:33:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:39,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 11:33:39,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-22 11:33:41,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 11:33:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-22 11:33:42,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:42,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446794973] [2024-11-22 11:33:42,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446794973] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 11:33:42,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:33:42,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2024-11-22 11:33:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732503605] [2024-11-22 11:33:42,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:42,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 11:33:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 11:33:42,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-22 11:33:42,203 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:42,759 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-11-22 11:33:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 11:33:42,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-11-22 11:33:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:42,760 INFO L225 Difference]: With dead ends: 61 [2024-11-22 11:33:42,760 INFO L226 Difference]: Without dead ends: 59 [2024-11-22 11:33:42,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-22 11:33:42,761 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 11:33:42,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 145 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 11:33:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-22 11:33:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2024-11-22 11:33:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 11:33:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-22 11:33:42,767 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 46 [2024-11-22 11:33:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:42,767 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-22 11:33:42,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-22 11:33:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 11:33:42,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:33:42,774 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:33:42,786 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 (6)] Forceful destruction successful, exit code 0 [2024-11-22 11:33:42,974 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-22 11:33:42,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:33:42,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:33:42,976 INFO L85 PathProgramCache]: Analyzing trace with hash -558095681, now seen corresponding path program 1 times [2024-11-22 11:33:42,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:33:42,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096389762] [2024-11-22 11:33:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:33:42,976 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-22 11:33:42,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:33:42,977 INFO L229 MonitoredProcess]: Starting monitored process 7 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-22 11:33:42,978 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 (7)] Waiting until timeout for monitored process [2024-11-22 11:33:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:33:43,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 11:33:43,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:33:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-22 11:33:43,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:33:43,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:33:43,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096389762] [2024-11-22 11:33:43,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096389762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:33:43,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:33:43,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 11:33:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920970655] [2024-11-22 11:33:43,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:33:43,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 11:33:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:33:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 11:33:43,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 11:33:43,679 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:33:43,901 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2024-11-22 11:33:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 11:33:43,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-11-22 11:33:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:33:43,903 INFO L225 Difference]: With dead ends: 57 [2024-11-22 11:33:43,903 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 11:33:43,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-22 11:33:43,904 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 11:33:43,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 191 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 11:33:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 11:33:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 11:33:43,905 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-22 11:33:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 11:33:43,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-11-22 11:33:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:33:43,905 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 11:33:43,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-22 11:33:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 11:33:43,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 11:33:43,907 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 11:33:43,912 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 (7)] Forceful destruction successful, exit code 0 [2024-11-22 11:33:44,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-22 11:33:44,111 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-22 11:33:44,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 11:33:45,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 11:33:45,151 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:45,151 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:45,151 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:45,151 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:45,152 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:45,153 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:45,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:45,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:45,156 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-22 11:33:45,157 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-22 11:33:45,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:33:45 BoogieIcfgContainer [2024-11-22 11:33:45,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 11:33:45,161 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 11:33:45,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 11:33:45,162 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 11:33:45,162 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:33:32" (3/4) ... [2024-11-22 11:33:45,164 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 11:33:45,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-22 11:33:45,171 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-22 11:33:45,171 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 11:33:45,173 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 11:33:45,173 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 11:33:45,246 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 11:33:45,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 11:33:45,249 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 11:33:45,249 INFO L158 Benchmark]: Toolchain (without parser) took 13601.03ms. Allocated memory was 60.8MB in the beginning and 536.9MB in the end (delta: 476.1MB). Free memory was 39.1MB in the beginning and 224.5MB in the end (delta: -185.4MB). Peak memory consumption was 291.1MB. Max. memory is 16.1GB. [2024-11-22 11:33:45,249 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 60.8MB. Free memory was 35.8MB in the beginning and 35.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:33:45,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.69ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 25.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 11:33:45,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.60ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 25.2MB in the beginning and 54.2MB in the end (delta: -29.0MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-22 11:33:45,250 INFO L158 Benchmark]: Boogie Preprocessor took 51.79ms. Allocated memory is still 73.4MB. Free memory was 54.2MB in the beginning and 51.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:33:45,250 INFO L158 Benchmark]: RCFGBuilder took 321.23ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 39.8MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 11:33:45,250 INFO L158 Benchmark]: TraceAbstraction took 12823.39ms. Allocated memory was 73.4MB in the beginning and 536.9MB in the end (delta: 463.5MB). Free memory was 39.2MB in the beginning and 229.8MB in the end (delta: -190.6MB). Peak memory consumption was 271.5MB. Max. memory is 16.1GB. [2024-11-22 11:33:45,251 INFO L158 Benchmark]: Witness Printer took 87.29ms. Allocated memory is still 536.9MB. Free memory was 229.8MB in the beginning and 224.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 11:33:45,252 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.69ms. Allocated memory is still 60.8MB. Free memory was 35.8MB in the beginning and 35.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.69ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 25.2MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.60ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 25.2MB in the beginning and 54.2MB in the end (delta: -29.0MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.79ms. Allocated memory is still 73.4MB. Free memory was 54.2MB in the beginning and 51.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 321.23ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 39.8MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12823.39ms. Allocated memory was 73.4MB in the beginning and 536.9MB in the end (delta: 463.5MB). Free memory was 39.2MB in the beginning and 229.8MB in the end (delta: -190.6MB). Peak memory consumption was 271.5MB. Max. memory is 16.1GB. * Witness Printer took 87.29ms. Allocated memory is still 536.9MB. Free memory was 229.8MB in the beginning and 224.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 712 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 488 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 224 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, InterpolantAutomatonStates: 36, 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, 6 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 311 ConstructedInterpolants, 2 QuantifiedInterpolants, 1155 SizeOfPredicates, 26 NumberOfNonLiveVariables, 469 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 417/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5)))) RESULT: Ultimate proved your program to be correct! [2024-11-22 11:33:45,292 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 Writing output log to file Ultimate.log Result: TRUE