./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:31:57,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:31:57,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:31:57,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:31:57,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:31:57,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:31:57,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:31:57,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:31:57,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:31:57,215 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:31:57,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:31:57,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:31:57,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:31:57,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:31:57,217 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:31:57,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:31:57,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:31:57,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:31:57,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:31:57,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:31:57,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:31:57,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:31:57,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:31:57,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:31:57,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:31:57,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:31:57,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:31:57,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:31:57,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:31:57,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:31:57,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:31:57,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:31:57,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:57,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:31:57,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:31:57,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:31:57,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:31:57,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:31:57,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:31:57,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:31:57,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:31:57,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:31:57,233 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b [2024-11-09 00:31:57,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:31:57,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:31:57,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:31:57,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:31:57,536 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:31:57,537 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-12.i [2024-11-09 00:31:59,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:31:59,226 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:31:59,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-11-09 00:31:59,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73627dad/c56419c819fa4dfc9cdea71a2b9b9335/FLAGc2a07c7c9 [2024-11-09 00:31:59,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73627dad/c56419c819fa4dfc9cdea71a2b9b9335 [2024-11-09 00:31:59,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:31:59,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:31:59,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:59,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:31:59,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:31:59,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677cba08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59, skipping insertion in model container [2024-11-09 00:31:59,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:31:59,488 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-12.i[915,928] [2024-11-09 00:31:59,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:59,545 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:31:59,558 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-12.i[915,928] [2024-11-09 00:31:59,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:59,648 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:31:59,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59 WrapperNode [2024-11-09 00:31:59,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:59,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:59,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:31:59,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:31:59,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,695 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 68 [2024-11-09 00:31:59,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:59,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:31:59,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:31:59,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:31:59,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,732 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-09 00:31:59,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:31:59,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:31:59,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:31:59,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:31:59,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (1/1) ... [2024-11-09 00:31:59,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:59,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:59,803 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-09 00:31:59,809 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-09 00:31:59,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:31:59,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:31:59,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:31:59,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:31:59,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:31:59,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:31:59,918 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:31:59,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:32:00,109 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:32:00,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:32:00,124 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:32:00,124 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:32:00,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:00 BoogieIcfgContainer [2024-11-09 00:32:00,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:32:00,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:32:00,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:32:00,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:32:00,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:31:59" (1/3) ... [2024-11-09 00:32:00,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3ba28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:00, skipping insertion in model container [2024-11-09 00:32:00,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:59" (2/3) ... [2024-11-09 00:32:00,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3ba28e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:00, skipping insertion in model container [2024-11-09 00:32:00,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:00" (3/3) ... [2024-11-09 00:32:00,136 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-12.i [2024-11-09 00:32:00,153 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:32:00,153 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:32:00,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:32:00,225 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;@593161f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:32:00,225 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:32:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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-09 00:32:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 00:32:00,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:00,239 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-09 00:32:00,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:00,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1159997385, now seen corresponding path program 1 times [2024-11-09 00:32:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:32:00,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478532188] [2024-11-09 00:32:00,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:00,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:32:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:32:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:00,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:32:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:00,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:32:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:00,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:32:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:32:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:00,534 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-09 00:32:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:32:00,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478532188] [2024-11-09 00:32:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478532188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:00,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:00,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:32:00,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298473335] [2024-11-09 00:32:00,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:32:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:32:00,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:32:00,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:32:00,581 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 00:32:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:00,605 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2024-11-09 00:32:00,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:32:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-09 00:32:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:00,615 INFO L225 Difference]: With dead ends: 53 [2024-11-09 00:32:00,615 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 00:32:00,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:32:00,624 INFO L432 NwaCegarLoop]: 32 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, 32 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-09 00:32:00,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:32:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 00:32:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 00:32:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 00:32:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-09 00:32:00,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 44 [2024-11-09 00:32:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:00,699 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-09 00:32:00,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 00:32:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-09 00:32:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 00:32:00,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:00,702 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-09 00:32:00,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:32:00,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:00,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1413855497, now seen corresponding path program 1 times [2024-11-09 00:32:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:32:00,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302708216] [2024-11-09 00:32:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:32:00,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:32:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:32:00,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:32:00,955 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:32:00,957 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:32:00,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:32:00,962 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:32:01,012 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:32:01,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:32:01 BoogieIcfgContainer [2024-11-09 00:32:01,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:32:01,016 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:32:01,016 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:32:01,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:32:01,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:00" (3/4) ... [2024-11-09 00:32:01,020 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:32:01,021 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:32:01,022 INFO L158 Benchmark]: Toolchain (without parser) took 1757.95ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 95.6MB in the beginning and 197.7MB in the end (delta: -102.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:01,023 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:01,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.86ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 137.0MB in the end (delta: -41.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-09 00:32:01,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.39ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 135.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:32:01,025 INFO L158 Benchmark]: Boogie Preprocessor took 51.65ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 135.1MB in the beginning and 214.2MB in the end (delta: -79.1MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-09 00:32:01,025 INFO L158 Benchmark]: RCFGBuilder took 375.97ms. Allocated memory is still 243.3MB. Free memory was 213.2MB in the beginning and 200.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:32:01,026 INFO L158 Benchmark]: TraceAbstraction took 888.38ms. Allocated memory is still 243.3MB. Free memory was 200.6MB in the beginning and 197.7MB in the end (delta: 2.9MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2024-11-09 00:32:01,026 INFO L158 Benchmark]: Witness Printer took 5.17ms. Allocated memory is still 243.3MB. Free memory is still 197.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:01,028 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.22ms. Allocated memory is still 167.8MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.86ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 137.0MB in the end (delta: -41.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.39ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 135.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.65ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 135.1MB in the beginning and 214.2MB in the end (delta: -79.1MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * RCFGBuilder took 375.97ms. Allocated memory is still 243.3MB. Free memory was 213.2MB in the beginning and 200.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 888.38ms. Allocated memory is still 243.3MB. Free memory was 200.6MB in the beginning and 197.7MB in the end (delta: 2.9MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. * Witness Printer took 5.17ms. Allocated memory is still 243.3MB. Free memory is still 197.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 4; [L23] signed char var_1_4 = -1; [L24] signed char var_1_5 = 100; [L25] signed long int var_1_6 = 1000; [L26] double var_1_7 = 4.5; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 0; [L29] signed long int var_1_10 = 256; [L30] signed char last_1_var_1_1 = 4; VAL [isInitial=0, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=-1, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L62] isInitial = 1 [L63] FCALL initially() [L64] COND TRUE 1 [L65] CALL updateLastVariables() [L55] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=-1, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L65] RET updateLastVariables() [L66] CALL updateVariables() [L44] var_1_4 = __VERIFIER_nondet_char() [L45] CALL assume_abort_if_not(var_1_4 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L45] RET assume_abort_if_not(var_1_4 >= -126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L46] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L46] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=100, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L47] var_1_5 = __VERIFIER_nondet_char() [L48] CALL assume_abort_if_not(var_1_5 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L48] RET assume_abort_if_not(var_1_5 >= -126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L49] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L49] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L50] var_1_9 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L51] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1] [L52] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L52] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=256, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=9/2, var_1_8=1, var_1_9=0] [L66] RET updateVariables() [L67] CALL step() [L34] var_1_7 = 199.5 [L35] var_1_8 = var_1_9 [L36] var_1_10 = var_1_5 [L37] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, last_1_var_1_1=4, stepLocal_0=4, var_1_10=4, var_1_1=4, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=399/2, var_1_8=0, var_1_9=0] [L38] COND TRUE stepLocal_0 >= last_1_var_1_1 [L39] var_1_1 = (((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) < 0 ) ? -((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) : ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=1000, var_1_7=399/2, var_1_8=0, var_1_9=0] [L41] var_1_6 = ((((var_1_4) > (var_1_1)) ? (var_1_4) : (var_1_1))) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] [L67] RET step() [L68] CALL, EXPR property() [L58-L59] return (((((var_1_10 >= last_1_var_1_1) ? (var_1_1 == ((signed char) (((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) < 0 ) ? -((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) : ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) : 1) && (var_1_6 == ((signed long int) ((((var_1_4) > (var_1_1)) ? (var_1_4) : (var_1_1)))))) && (var_1_7 == ((double) 199.5))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((signed long int) var_1_5)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] [L68] RET, EXPR property() [L68] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=4, var_1_10=4, var_1_1=0, var_1_4=0, var_1_5=4, var_1_6=0, var_1_7=399/2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 32 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, 32 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 43 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 60/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:32:01,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:32:03,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:32:03,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:32:03,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:32:03,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:32:03,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:32:03,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:32:03,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:32:03,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:32:03,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:32:03,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:32:03,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:32:03,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:32:03,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:32:03,442 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:32:03,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:32:03,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:32:03,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:32:03,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:32:03,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:32:03,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:32:03,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:32:03,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:32:03,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:32:03,448 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:32:03,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:32:03,448 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:32:03,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:32:03,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:32:03,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:32:03,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:32:03,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:32:03,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:32:03,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:32:03,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:03,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:32:03,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:32:03,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:32:03,455 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:32:03,456 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:32:03,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:32:03,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:32:03,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:32:03,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:32:03,457 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 148999594253053f645653c1095151edf31299f622d6000962ab26f32e38bd4b [2024-11-09 00:32:03,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:32:03,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:32:03,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:32:03,842 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:32:03,842 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:32:03,843 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-12.i [2024-11-09 00:32:05,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:32:05,550 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:32:05,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-12.i [2024-11-09 00:32:05,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a9377d7/934ed42de9d14008b95b312d5f9e1a49/FLAG1c15504d4 [2024-11-09 00:32:05,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a9377d7/934ed42de9d14008b95b312d5f9e1a49 [2024-11-09 00:32:05,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:32:05,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:32:05,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:05,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:32:05,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:32:05,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:05,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b53190a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05, skipping insertion in model container [2024-11-09 00:32:05,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:05,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:32:05,817 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-12.i[915,928] [2024-11-09 00:32:05,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:05,883 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:32:05,898 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-12.i[915,928] [2024-11-09 00:32:05,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:05,939 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:32:05,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05 WrapperNode [2024-11-09 00:32:05,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:05,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:05,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:32:05,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:32:05,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:05,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:05,996 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 66 [2024-11-09 00:32:05,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:05,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:32:05,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:32:05,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:32:06,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,028 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-09 00:32:06,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:32:06,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:32:06,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:32:06,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:32:06,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (1/1) ... [2024-11-09 00:32:06,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:06,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:32:06,090 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-09 00:32:06,093 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-09 00:32:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:32:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:32:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:32:06,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:32:06,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:32:06,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:32:06,208 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:32:06,211 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:32:06,422 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:32:06,422 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:32:06,435 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:32:06,436 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:32:06,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:06 BoogieIcfgContainer [2024-11-09 00:32:06,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:32:06,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:32:06,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:32:06,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:32:06,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:32:05" (1/3) ... [2024-11-09 00:32:06,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32870b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:06, skipping insertion in model container [2024-11-09 00:32:06,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:05" (2/3) ... [2024-11-09 00:32:06,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32870b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:06, skipping insertion in model container [2024-11-09 00:32:06,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:06" (3/3) ... [2024-11-09 00:32:06,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-12.i [2024-11-09 00:32:06,464 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:32:06,465 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:32:06,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:32:06,545 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;@4a11d23d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:32:06,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:32:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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-09 00:32:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 00:32:06,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:06,561 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-09 00:32:06,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:06,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:06,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1159997385, now seen corresponding path program 1 times [2024-11-09 00:32:06,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:06,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675891446] [2024-11-09 00:32:06,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:06,585 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-09 00:32:06,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:06,588 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-09 00:32:06,589 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-09 00:32:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:06,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:32:06,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:06,772 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-09 00:32:06,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:32:06,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:32:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675891446] [2024-11-09 00:32:06,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675891446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:06,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:06,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:32:06,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719756954] [2024-11-09 00:32:06,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:06,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:32:06,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:32:06,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:32:06,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:32:06,806 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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-09 00:32:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:06,827 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2024-11-09 00:32:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:32:06,830 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-09 00:32:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:06,836 INFO L225 Difference]: With dead ends: 53 [2024-11-09 00:32:06,837 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 00:32:06,840 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-09 00:32:06,845 INFO L432 NwaCegarLoop]: 32 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, 32 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-09 00:32:06,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:32:06,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 00:32:06,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 00:32:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 00:32:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-09 00:32:06,889 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 44 [2024-11-09 00:32:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:06,890 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-09 00:32:06,890 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-09 00:32:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-09 00:32:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 00:32:06,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:06,893 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-09 00:32:06,900 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-09 00:32:07,094 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-09 00:32:07,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:07,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1413855497, now seen corresponding path program 1 times [2024-11-09 00:32:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:07,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315848488] [2024-11-09 00:32:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:07,099 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-09 00:32:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:07,102 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-09 00:32:07,103 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-09 00:32:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:07,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 00:32:07,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:13,530 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-09 00:32:13,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:32:13,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:32:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315848488] [2024-11-09 00:32:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315848488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:13,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:13,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 00:32:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537580581] [2024-11-09 00:32:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:13,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:32:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:32:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:32:13,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:32:13,537 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 00:32:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:13,858 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-09 00:32:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:32:13,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-11-09 00:32:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:13,861 INFO L225 Difference]: With dead ends: 44 [2024-11-09 00:32:13,861 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 00:32:13,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:32:13,863 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 23 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:32:13,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 161 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:32:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 00:32:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-09 00:32:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:32:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-09 00:32:13,880 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 44 [2024-11-09 00:32:13,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:13,881 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-09 00:32:13,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 00:32:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-09 00:32:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 00:32:13,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:13,883 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-09 00:32:13,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:32:14,086 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-09 00:32:14,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1356597195, now seen corresponding path program 1 times [2024-11-09 00:32:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:14,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947828274] [2024-11-09 00:32:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:14,089 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-09 00:32:14,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:14,093 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-09 00:32:14,094 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-09 00:32:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:14,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:32:14,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:17,225 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-09 00:32:17,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:32:17,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:32:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947828274] [2024-11-09 00:32:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947828274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:17,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:17,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:32:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314266230] [2024-11-09 00:32:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:17,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:32:17,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:32:17,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:32:17,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:32:17,229 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 00:32:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:17,492 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-11-09 00:32:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:32:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-11-09 00:32:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:17,494 INFO L225 Difference]: With dead ends: 66 [2024-11-09 00:32:17,495 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 00:32:17,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:32:17,496 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:32:17,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 194 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:32:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 00:32:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-11-09 00:32:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 45 states have internal predecessors, (47), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 00:32:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2024-11-09 00:32:17,510 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2024-11-09 00:32:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:17,510 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2024-11-09 00:32:17,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 00:32:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2024-11-09 00:32:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 00:32:17,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:17,513 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:32:17,518 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-09 00:32:17,717 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-09 00:32:17,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash -272324834, now seen corresponding path program 1 times [2024-11-09 00:32:17,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925441224] [2024-11-09 00:32:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:17,719 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-09 00:32:17,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:17,722 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-09 00:32:17,723 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-09 00:32:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:17,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 00:32:17,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-11-09 00:32:19,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:32:19,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:32:19,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925441224] [2024-11-09 00:32:19,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925441224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 00:32:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091610179] [2024-11-09 00:32:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:19,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:32:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:32:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:32:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:32:19,547 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-09 00:32:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:19,697 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-11-09 00:32:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:32:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 85 [2024-11-09 00:32:19,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:19,699 INFO L225 Difference]: With dead ends: 65 [2024-11-09 00:32:19,699 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:32:19,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:32:19,702 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:32:19,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:32:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:32:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:32:19,704 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-09 00:32:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:32:19,704 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-11-09 00:32:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:19,705 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:32:19,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-09 00:32:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:32:19,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:32:19,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:32:19,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 00:32:19,909 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-09 00:32:19,912 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:32:19,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:32:20,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:32:20,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 00:32:20,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:32:20 BoogieIcfgContainer [2024-11-09 00:32:20,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:32:20,208 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:32:20,208 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:32:20,208 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:32:20,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:06" (3/4) ... [2024-11-09 00:32:20,211 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:32:20,214 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:32:20,218 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 00:32:20,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:32:20,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:32:20,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:32:20,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:32:20,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:32:20,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:32:20,314 INFO L158 Benchmark]: Toolchain (without parser) took 14729.09ms. Allocated memory was 60.8MB in the beginning and 612.4MB in the end (delta: 551.6MB). Free memory was 37.8MB in the beginning and 574.0MB in the end (delta: -536.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:32:20,315 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 60.8MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:20,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.84ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 24.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:32:20,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.84ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 23.8MB in the beginning and 52.8MB in the end (delta: -29.0MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-09 00:32:20,316 INFO L158 Benchmark]: Boogie Preprocessor took 57.29ms. Allocated memory is still 73.4MB. Free memory was 52.8MB in the beginning and 50.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:32:20,316 INFO L158 Benchmark]: RCFGBuilder took 380.75ms. Allocated memory is still 73.4MB. Free memory was 50.4MB in the beginning and 38.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:32:20,316 INFO L158 Benchmark]: TraceAbstraction took 13767.86ms. Allocated memory was 73.4MB in the beginning and 612.4MB in the end (delta: 539.0MB). Free memory was 37.6MB in the beginning and 579.3MB in the end (delta: -541.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-09 00:32:20,317 INFO L158 Benchmark]: Witness Printer took 106.20ms. Allocated memory is still 612.4MB. Free memory was 579.3MB in the beginning and 574.0MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:32:20,319 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 60.8MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.84ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 24.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.84ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 23.8MB in the beginning and 52.8MB in the end (delta: -29.0MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.29ms. Allocated memory is still 73.4MB. Free memory was 52.8MB in the beginning and 50.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 380.75ms. Allocated memory is still 73.4MB. Free memory was 50.4MB in the beginning and 38.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13767.86ms. Allocated memory was 73.4MB in the beginning and 612.4MB in the end (delta: 539.0MB). Free memory was 37.6MB in the beginning and 579.3MB in the end (delta: -541.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 106.20ms. Allocated memory is still 612.4MB. Free memory was 579.3MB in the beginning and 574.0MB 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 * 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 137 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 773 SizeOfPredicates, 30 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 460/460 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((var_1_1 == 4) && (4 == last_1_var_1_1)) || ((var_1_5 == var_1_10) && (var_1_8 == var_1_9))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (last_1_var_1_1 == \old(last_1_var_1_1))) RESULT: Ultimate proved your program to be correct! [2024-11-09 00:32:20,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE