./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_amount25_file-15.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 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:25:35,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:25:35,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:25:35,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:25:35,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:25:35,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:25:35,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:25:35,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:25:35,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:25:35,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:25:35,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:25:35,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:25:35,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:25:35,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:25:35,908 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:25:35,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:25:35,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:25:35,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:25:35,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:25:35,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:25:35,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:25:35,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:25:35,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:25:35,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:25:35,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:25:35,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:25:35,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:25:35,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:25:35,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:25:35,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:25:35,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:25:35,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:25:35,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:25:35,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:25:35,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:25:35,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:25:35,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:25:35,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:25:35,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:25:35,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:25:35,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:25:35,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:25:35,919 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 -> 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 [2024-11-12 06:25:36,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:25:36,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:25:36,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:25:36,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:25:36,237 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:25:36,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2024-11-12 06:25:37,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:25:38,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:25:38,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2024-11-12 06:25:38,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec13559e/dcc487e621994a788f9371cb5bc07552/FLAGaccd9f71f [2024-11-12 06:25:38,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec13559e/dcc487e621994a788f9371cb5bc07552 [2024-11-12 06:25:38,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:25:38,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:25:38,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:25:38,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:25:38,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:25:38,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd1adf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38, skipping insertion in model container [2024-11-12 06:25:38,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:25:38,243 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_amount25_file-15.i[915,928] [2024-11-12 06:25:38,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:25:38,301 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:25:38,313 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_amount25_file-15.i[915,928] [2024-11-12 06:25:38,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:25:38,357 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:25:38,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38 WrapperNode [2024-11-12 06:25:38,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:25:38,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:25:38,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:25:38,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:25:38,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,404 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-12 06:25:38,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:25:38,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:25:38,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:25:38,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:25:38,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,452 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-12 06:25:38,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:25:38,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:25:38,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:25:38,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:25:38,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (1/1) ... [2024-11-12 06:25:38,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:25:38,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:25:38,516 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-12 06:25:38,519 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-12 06:25:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:25:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:25:38,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:25:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:25:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:25:38,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:25:38,676 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:25:38,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:25:38,899 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 06:25:38,899 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:25:38,909 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:25:38,910 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:25:38,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:38 BoogieIcfgContainer [2024-11-12 06:25:38,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:25:38,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:25:38,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:25:38,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:25:38,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:25:38" (1/3) ... [2024-11-12 06:25:38,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ebb90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:25:38, skipping insertion in model container [2024-11-12 06:25:38,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:38" (2/3) ... [2024-11-12 06:25:38,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ebb90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:25:38, skipping insertion in model container [2024-11-12 06:25:38,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:38" (3/3) ... [2024-11-12 06:25:38,921 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-15.i [2024-11-12 06:25:38,936 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:25:38,937 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:25:38,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:25:38,995 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;@51cd11ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:25:38,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:25:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 06:25:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 06:25:39,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:39,010 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:39,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:39,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2034627107, now seen corresponding path program 1 times [2024-11-12 06:25:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:25:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040894931] [2024-11-12 06:25:39,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:25:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:25:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:25:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:25:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:25:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:25:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:25:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:25:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:25:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:25:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:25:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 06:25:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:25:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040894931] [2024-11-12 06:25:39,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040894931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:25:39,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:25:39,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:25:39,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556128546] [2024-11-12 06:25:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:25:39,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:25:39,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:25:39,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:25:39,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:25:39,324 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 06:25:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:25:39,345 INFO L93 Difference]: Finished difference Result 73 states and 117 transitions. [2024-11-12 06:25:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:25:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2024-11-12 06:25:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:25:39,354 INFO L225 Difference]: With dead ends: 73 [2024-11-12 06:25:39,354 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 06:25:39,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-12 06:25:39,360 INFO L435 NwaCegarLoop]: 49 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, 49 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-12 06:25:39,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:25:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 06:25:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 06:25:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 06:25:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 06:25:39,403 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 62 [2024-11-12 06:25:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:25:39,404 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 06:25:39,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 06:25:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 06:25:39,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 06:25:39,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:39,409 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:39,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:25:39,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:39,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2090256293, now seen corresponding path program 1 times [2024-11-12 06:25:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:25:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939544403] [2024-11-12 06:25:39,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:25:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:25:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:25:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:25:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:25:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:25:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:25:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:25:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:25:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:25:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:25:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 06:25:39,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:25:39,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939544403] [2024-11-12 06:25:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939544403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:25:39,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:25:39,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:25:39,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39597782] [2024-11-12 06:25:39,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:25:39,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:25:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:25:39,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:25:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:25:39,939 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 06:25:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:25:40,088 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2024-11-12 06:25:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:25:40,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2024-11-12 06:25:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:25:40,090 INFO L225 Difference]: With dead ends: 102 [2024-11-12 06:25:40,091 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 06:25:40,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:25:40,094 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:25:40,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 171 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:25:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 06:25:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-11-12 06:25:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:25:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2024-11-12 06:25:40,124 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 62 [2024-11-12 06:25:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:25:40,125 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2024-11-12 06:25:40,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 06:25:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2024-11-12 06:25:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 06:25:40,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:40,130 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:40,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:25:40,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:40,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash -582413953, now seen corresponding path program 1 times [2024-11-12 06:25:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:25:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537875418] [2024-11-12 06:25:40,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:25:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:25:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:25:40,204 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:25:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:25:40,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:25:40,275 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:25:40,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:25:40,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:25:40,282 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 06:25:40,346 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:25:40,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:25:40 BoogieIcfgContainer [2024-11-12 06:25:40,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:25:40,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:25:40,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:25:40,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:25:40,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:38" (3/4) ... [2024-11-12 06:25:40,357 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:25:40,358 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:25:40,359 INFO L158 Benchmark]: Toolchain (without parser) took 2310.33ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 94.2MB in the beginning and 168.2MB in the end (delta: -74.1MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-11-12 06:25:40,359 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 167.8MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:25:40,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.67ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 80.5MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:25:40,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.24ms. Allocated memory is still 167.8MB. Free memory was 80.5MB in the beginning and 78.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:25:40,363 INFO L158 Benchmark]: Boogie Preprocessor took 66.02ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 76.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:25:40,364 INFO L158 Benchmark]: RCFGBuilder took 434.30ms. Allocated memory is still 167.8MB. Free memory was 76.5MB in the beginning and 129.2MB in the end (delta: -52.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-12 06:25:40,364 INFO L158 Benchmark]: TraceAbstraction took 1440.51ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 129.2MB in the beginning and 169.3MB in the end (delta: -40.0MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2024-11-12 06:25:40,364 INFO L158 Benchmark]: Witness Printer took 5.18ms. Allocated memory is still 243.3MB. Free memory was 169.3MB in the beginning and 168.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:25:40,366 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.43ms. Allocated memory is still 167.8MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.67ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 80.5MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.24ms. Allocated memory is still 167.8MB. Free memory was 80.5MB in the beginning and 78.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.02ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 76.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.30ms. Allocated memory is still 167.8MB. Free memory was 76.5MB in the beginning and 129.2MB in the end (delta: -52.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1440.51ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 129.2MB in the beginning and 169.3MB in the end (delta: -40.0MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * Witness Printer took 5.18ms. Allocated memory is still 243.3MB. Free memory was 169.3MB in the beginning and 168.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -128; [L23] unsigned short int var_1_3 = 16; [L24] unsigned long int var_1_7 = 1000; [L25] signed char var_1_8 = -4; [L26] signed short int var_1_9 = 2; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_11 = 0; [L29] double var_1_12 = 0.95; [L30] double var_1_13 = 9.8; [L31] signed short int last_1_var_1_9 = 2; [L32] unsigned char last_1_var_1_10 = 1; VAL [isInitial=0, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] CALL updateLastVariables() [L79] last_1_var_1_9 = var_1_9 [L80] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_3=16, var_1_7=1000, var_1_8=-4, var_1_9=2] [L90] RET updateLastVariables() [L91] CALL updateVariables() [L63] var_1_3 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L65] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_7=1000, var_1_8=-4, var_1_9=2] [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-4, var_1_9=2] [L69] var_1_8 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L70] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L71] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L71] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=0, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L72] var_1_11 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L73] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L74] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=-256, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=-256, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L74] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=-256, var_1_12=19/20, var_1_13=49/5, var_1_1=-128, var_1_8=-127, var_1_9=2] [L75] var_1_13 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=-256, var_1_12=19/20, var_1_1=-128, var_1_8=-127, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=-256, var_1_12=19/20, var_1_1=-128, var_1_8=-127, var_1_9=2] [L76] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=-256, var_1_12=19/20, var_1_1=-128, var_1_8=-127, var_1_9=2] [L91] RET updateVariables() [L92] CALL step() [L36] signed long int stepLocal_2 = last_1_var_1_9; [L37] unsigned char stepLocal_1 = (- var_1_7) <= last_1_var_1_9; [L38] unsigned char stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_0=1, stepLocal_2=2, var_1_10=1, var_1_11=-256, var_1_12=19/20, var_1_1=-128, var_1_7=4294967293, var_1_8=-127, var_1_9=2] [L39] COND TRUE stepLocal_0 || ((~ last_1_var_1_9) >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, stepLocal_2=2, var_1_10=1, var_1_11=-256, var_1_12=19/20, var_1_1=-128, var_1_7=4294967293, var_1_8=-127, var_1_9=2] [L40] COND FALSE !(last_1_var_1_9 < stepLocal_2) [L49] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=1, var_1_11=-256, var_1_12=19/20, var_1_1=-127, var_1_7=4294967293, var_1_8=-127, var_1_9=2] [L54] var_1_10 = var_1_11 [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=-256, var_1_11=-256, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-127, var_1_7=4294967293, var_1_8=-127, var_1_9=2] [L56] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=-256, var_1_11=-256, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-127, var_1_7=4294967293, var_1_8=-127, var_1_9=2] [L92] RET step() [L93] CALL, EXPR property() [L83-L84] return ((((last_1_var_1_10 || ((~ last_1_var_1_9) >= last_1_var_1_9)) ? ((last_1_var_1_9 < last_1_var_1_9) ? ((! last_1_var_1_10) ? (((last_1_var_1_9 > last_1_var_1_9) && ((- var_1_7) <= last_1_var_1_9)) ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_8))) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && (var_1_10 ? ((((4131182089u - var_1_3) - 200u) < var_1_1) ? (var_1_9 == ((signed short int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) var_1_13)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=-256, var_1_11=-256, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-127, var_1_3=0, var_1_7=4294967293, var_1_8=-127, var_1_9=2] [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=-256, var_1_11=-256, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-127, var_1_3=0, var_1_7=4294967293, var_1_8=-127, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=1, last_1_var_1_9=2, var_1_10=-256, var_1_11=-256, var_1_12=4294967298, var_1_13=4294967298, var_1_1=-127, var_1_3=0, var_1_7=4294967293, var_1_8=-127, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 94 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 288/288 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-12 06:25:40,400 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_amount25_file-15.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 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:25:42,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:25:42,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:25:42,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:25:42,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:25:42,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:25:42,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:25:42,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:25:42,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:25:42,782 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:25:42,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:25:42,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:25:42,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:25:42,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:25:42,784 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:25:42,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:25:42,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:25:42,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:25:42,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:25:42,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:25:42,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:25:42,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:25:42,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:25:42,789 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:25:42,790 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:25:42,790 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:25:42,790 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:25:42,790 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:25:42,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:25:42,791 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:25:42,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:25:42,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:25:42,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:25:42,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:25:42,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:25:42,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:25:42,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:25:42,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:25:42,792 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:25:42,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:25:42,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:25:42,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:25:42,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:25:42,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:25:42,795 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 -> 1ca4ba71ef8f01ac6963c6fc45a8e45259ba03efeeb723e37ea785d69c88b0e8 [2024-11-12 06:25:43,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:25:43,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:25:43,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:25:43,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:25:43,193 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:25:43,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2024-11-12 06:25:44,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:25:45,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:25:45,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-15.i [2024-11-12 06:25:45,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7ba762b/c3b28ff328e248d78057d79ebcf07a52/FLAGb01d90d80 [2024-11-12 06:25:45,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d7ba762b/c3b28ff328e248d78057d79ebcf07a52 [2024-11-12 06:25:45,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:25:45,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:25:45,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:25:45,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:25:45,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:25:45,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef0d3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45, skipping insertion in model container [2024-11-12 06:25:45,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:25:45,259 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_amount25_file-15.i[915,928] [2024-11-12 06:25:45,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:25:45,329 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:25:45,340 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_amount25_file-15.i[915,928] [2024-11-12 06:25:45,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:25:45,385 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:25:45,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45 WrapperNode [2024-11-12 06:25:45,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:25:45,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:25:45,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:25:45,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:25:45,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,434 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2024-11-12 06:25:45,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:25:45,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:25:45,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:25:45,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:25:45,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,469 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-12 06:25:45,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:25:45,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:25:45,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:25:45,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:25:45,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (1/1) ... [2024-11-12 06:25:45,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:25:45,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:25:45,559 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-12 06:25:45,567 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-12 06:25:45,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:25:45,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:25:45,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:25:45,628 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:25:45,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:25:45,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:25:45,752 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:25:45,762 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:25:46,006 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 06:25:46,007 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:25:46,027 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:25:46,028 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:25:46,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:46 BoogieIcfgContainer [2024-11-12 06:25:46,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:25:46,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:25:46,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:25:46,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:25:46,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:25:45" (1/3) ... [2024-11-12 06:25:46,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417058d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:25:46, skipping insertion in model container [2024-11-12 06:25:46,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:25:45" (2/3) ... [2024-11-12 06:25:46,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417058d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:25:46, skipping insertion in model container [2024-11-12 06:25:46,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:46" (3/3) ... [2024-11-12 06:25:46,047 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-15.i [2024-11-12 06:25:46,069 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:25:46,069 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:25:46,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:25:46,137 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;@1e850e05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:25:46,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:25:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 06:25:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 06:25:46,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:46,149 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:46,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:46,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2034627107, now seen corresponding path program 1 times [2024-11-12 06:25:46,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:25:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584235821] [2024-11-12 06:25:46,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:25:46,167 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-12 06:25:46,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:25:46,171 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-12 06:25:46,172 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-12 06:25:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:46,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:25:46,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:25:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 06:25:46,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:25:46,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:25:46,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584235821] [2024-11-12 06:25:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584235821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:25:46,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:25:46,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:25:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62851131] [2024-11-12 06:25:46,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:25:46,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:25:46,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:25:46,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:25:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:25:46,380 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 06:25:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:25:46,406 INFO L93 Difference]: Finished difference Result 73 states and 117 transitions. [2024-11-12 06:25:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:25:46,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2024-11-12 06:25:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:25:46,416 INFO L225 Difference]: With dead ends: 73 [2024-11-12 06:25:46,417 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 06:25:46,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 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-12 06:25:46,423 INFO L435 NwaCegarLoop]: 49 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, 49 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-12 06:25:46,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:25:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 06:25:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 06:25:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 06:25:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 06:25:46,475 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 62 [2024-11-12 06:25:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:25:46,475 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 06:25:46,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 06:25:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 06:25:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 06:25:46,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:46,478 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:46,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 06:25:46,683 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-12 06:25:46,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:46,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2090256293, now seen corresponding path program 1 times [2024-11-12 06:25:46,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:25:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846473657] [2024-11-12 06:25:46,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:25:46,685 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-12 06:25:46,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:25:46,687 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-12 06:25:46,689 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-12 06:25:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:46,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 06:25:46,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:25:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 06:25:46,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:25:46,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:25:46,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846473657] [2024-11-12 06:25:46,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846473657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:25:46,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:25:46,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:25:46,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893570023] [2024-11-12 06:25:46,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:25:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:25:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:25:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:25:46,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:25:46,979 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 06:25:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:25:47,148 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2024-11-12 06:25:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:25:47,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2024-11-12 06:25:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:25:47,151 INFO L225 Difference]: With dead ends: 102 [2024-11-12 06:25:47,151 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 06:25:47,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:25:47,154 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:25:47,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 169 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:25:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 06:25:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2024-11-12 06:25:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 06:25:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2024-11-12 06:25:47,169 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 62 [2024-11-12 06:25:47,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:25:47,171 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2024-11-12 06:25:47,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 06:25:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2024-11-12 06:25:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 06:25:47,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:47,172 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:47,180 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-12 06:25:47,377 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-12 06:25:47,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:47,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:47,379 INFO L85 PathProgramCache]: Analyzing trace with hash -582413953, now seen corresponding path program 1 times [2024-11-12 06:25:47,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:25:47,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007455249] [2024-11-12 06:25:47,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:25:47,379 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-12 06:25:47,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:25:47,383 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-12 06:25:47,384 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-12 06:25:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:47,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 06:25:47,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:25:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 06:25:53,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:25:53,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:25:53,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007455249] [2024-11-12 06:25:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007455249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:25:53,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:25:53,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 06:25:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889611343] [2024-11-12 06:25:53,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:25:53,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 06:25:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:25:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 06:25:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-12 06:25:53,252 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 06:25:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:25:54,026 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2024-11-12 06:25:54,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 06:25:54,027 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-11-12 06:25:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:25:54,028 INFO L225 Difference]: With dead ends: 134 [2024-11-12 06:25:54,029 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 06:25:54,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2024-11-12 06:25:54,030 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 96 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 06:25:54,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 208 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 06:25:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 06:25:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2024-11-12 06:25:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 63 states have internal predecessors, (69), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:25:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2024-11-12 06:25:54,043 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 63 [2024-11-12 06:25:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:25:54,043 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2024-11-12 06:25:54,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 06:25:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2024-11-12 06:25:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 06:25:54,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:25:54,046 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:25:54,052 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-12 06:25:54,246 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-12 06:25:54,248 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:25:54,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:25:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1668570716, now seen corresponding path program 1 times [2024-11-12 06:25:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:25:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54365500] [2024-11-12 06:25:54,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:25:54,251 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-12 06:25:54,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:25:54,255 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-12 06:25:54,256 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-12 06:25:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:25:54,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 06:25:54,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:25:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 06:25:54,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:25:54,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:25:54,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54365500] [2024-11-12 06:25:54,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54365500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:25:54,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:25:54,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 06:25:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945638850] [2024-11-12 06:25:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:25:54,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:25:54,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:25:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:25:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:25:54,437 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 06:25:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:25:54,559 INFO L93 Difference]: Finished difference Result 135 states and 163 transitions. [2024-11-12 06:25:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 06:25:54,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-12 06:25:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:25:54,561 INFO L225 Difference]: With dead ends: 135 [2024-11-12 06:25:54,562 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 06:25:54,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:25:54,565 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 32 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:25:54,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:25:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 06:25:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 06:25:54,568 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-12 06:25:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 06:25:54,568 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-11-12 06:25:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:25:54,570 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 06:25:54,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-12 06:25:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 06:25:54,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 06:25:54,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:25:54,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 06:25:54,775 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-12 06:25:54,779 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 06:25:54,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 06:25:55,828 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:25:55,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,847 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:25:55,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,848 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:25:55,850 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,855 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:25:55,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:25:55,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:25:55,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:25:55 BoogieIcfgContainer [2024-11-12 06:25:55,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:25:55,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:25:55,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:25:55,863 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:25:55,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:25:46" (3/4) ... [2024-11-12 06:25:55,865 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 06:25:55,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 06:25:55,874 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 06:25:55,875 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 06:25:55,875 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 06:25:55,876 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 06:25:55,983 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 06:25:55,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 06:25:55,984 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:25:55,985 INFO L158 Benchmark]: Toolchain (without parser) took 10917.12ms. Allocated memory was 71.3MB in the beginning and 629.1MB in the end (delta: 557.8MB). Free memory was 51.1MB in the beginning and 554.6MB in the end (delta: -503.5MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2024-11-12 06:25:55,985 INFO L158 Benchmark]: CDTParser took 1.32ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:25:55,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.54ms. Allocated memory is still 71.3MB. Free memory was 50.7MB in the beginning and 36.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:25:55,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.74ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 34.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:25:55,985 INFO L158 Benchmark]: Boogie Preprocessor took 63.40ms. Allocated memory is still 71.3MB. Free memory was 34.7MB in the beginning and 32.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:25:55,986 INFO L158 Benchmark]: RCFGBuilder took 530.28ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 32.1MB in the beginning and 75.6MB in the end (delta: -43.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:25:55,986 INFO L158 Benchmark]: TraceAbstraction took 9826.87ms. Allocated memory was 109.1MB in the beginning and 629.1MB in the end (delta: 520.1MB). Free memory was 74.9MB in the beginning and 559.9MB in the end (delta: -485.0MB). Peak memory consumption was 326.0MB. Max. memory is 16.1GB. [2024-11-12 06:25:55,986 INFO L158 Benchmark]: Witness Printer took 121.77ms. Allocated memory is still 629.1MB. Free memory was 559.9MB in the beginning and 554.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:25:55,987 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.32ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 47.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.54ms. Allocated memory is still 71.3MB. Free memory was 50.7MB in the beginning and 36.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.74ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 34.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.40ms. Allocated memory is still 71.3MB. Free memory was 34.7MB in the beginning and 32.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 530.28ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 32.1MB in the beginning and 75.6MB in the end (delta: -43.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9826.87ms. Allocated memory was 109.1MB in the beginning and 629.1MB in the end (delta: 520.1MB). Free memory was 74.9MB in the beginning and 559.9MB in the end (delta: -485.0MB). Peak memory consumption was 326.0MB. Max. memory is 16.1GB. * Witness Printer took 121.77ms. Allocated memory is still 629.1MB. Free memory was 559.9MB in the beginning and 554.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 477 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 257 IncrementalHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 170 mSDtfsCounter, 257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=3, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 887 SizeOfPredicates, 15 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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: 89]: Loop Invariant Derived loop invariant: ((((((var_1_9 == 2) && (2 == last_1_var_1_9)) && (1 == var_1_10)) && (last_1_var_1_10 == 1)) && (var_1_11 <= 0)) || ((((((var_1_1 == var_1_8) && (var_1_9 == 2)) && (2 == last_1_var_1_9)) && (var_1_13 == var_1_12)) && (var_1_10 == var_1_11)) && (var_1_11 <= 0))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_9 == 2) && (2 == last_1_var_1_9)) Ensures: ((((var_1_9 == 2) && (2 == last_1_var_1_9)) && (0 != cond)) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (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))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (last_1_var_1_9 == \old(last_1_var_1_9))) && (last_1_var_1_10 == \old(last_1_var_1_10)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 06:25:56,044 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