./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c -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 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 22:33:49,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:33:49,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 22:33:49,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:33:49,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:33:49,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:33:49,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:33:49,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:33:49,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:33:49,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:33:49,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:33:49,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:33:49,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:33:49,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:33:49,896 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:33:49,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:33:49,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:33:49,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:33:49,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 22:33:49,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:33:49,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:33:49,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:33:49,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:33:49,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:33:49,902 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:33:49,902 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:33:49,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:33:49,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:33:49,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:33:49,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:33:49,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:33:49,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:33:49,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:49,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:33:49,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:33:49,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:33:49,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 22:33:49,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 22:33:49,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:33:49,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:33:49,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:33:49,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:33:49,908 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 [2024-10-23 22:33:50,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:33:50,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:33:50,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:33:50,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:33:50,215 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:33:50,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-10-23 22:33:51,730 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:33:51,922 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:33:51,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-10-23 22:33:51,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c49c6667/31cf9935344f4919a02aee6427a04bde/FLAG061791e57 [2024-10-23 22:33:51,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c49c6667/31cf9935344f4919a02aee6427a04bde [2024-10-23 22:33:51,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:33:51,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:33:51,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:51,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:33:51,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:33:51,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:51" (1/1) ... [2024-10-23 22:33:51,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f0f34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:51, skipping insertion in model container [2024-10-23 22:33:51,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:51" (1/1) ... [2024-10-23 22:33:51,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:33:52,169 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c[1656,1669] [2024-10-23 22:33:52,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:52,184 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 22:33:52,209 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c[1656,1669] [2024-10-23 22:33:52,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:52,228 INFO L204 MainTranslator]: Completed translation [2024-10-23 22:33:52,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52 WrapperNode [2024-10-23 22:33:52,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:52,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 22:33:52,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 22:33:52,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 22:33:52,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,269 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-10-23 22:33:52,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 22:33:52,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 22:33:52,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 22:33:52,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 22:33:52,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,303 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-23 22:33:52,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 22:33:52,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 22:33:52,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 22:33:52,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 22:33:52,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:52,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 22:33:52,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 22:33:52,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 22:33:52,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 22:33:52,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 22:33:52,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 22:33:52,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-23 22:33:52,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 22:33:52,414 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-23 22:33:52,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-23 22:33:52,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-23 22:33:52,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-23 22:33:52,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-23 22:33:52,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 22:33:52,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 22:33:52,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 22:33:52,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 22:33:52,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-23 22:33:52,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 22:33:52,495 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 22:33:52,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 22:33:52,789 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-23 22:33:52,789 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 22:33:52,830 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 22:33:52,831 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-23 22:33:52,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:52 BoogieIcfgContainer [2024-10-23 22:33:52,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 22:33:52,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 22:33:52,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 22:33:52,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 22:33:52,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:33:51" (1/3) ... [2024-10-23 22:33:52,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0673b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:33:52, skipping insertion in model container [2024-10-23 22:33:52,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (2/3) ... [2024-10-23 22:33:52,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0673b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:33:52, skipping insertion in model container [2024-10-23 22:33:52,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:52" (3/3) ... [2024-10-23 22:33:52,841 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2024-10-23 22:33:52,858 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 22:33:52,859 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 22:33:52,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 22:33:52,928 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;@6683bc68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 22:33:52,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 22:33:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 22:33:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-23 22:33:52,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:52,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:33:52,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:52,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2030686387, now seen corresponding path program 1 times [2024-10-23 22:33:52,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:52,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060517260] [2024-10-23 22:33:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:33:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:53,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060517260] [2024-10-23 22:33:53,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060517260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:53,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:53,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:33:53,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009930080] [2024-10-23 22:33:53,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:53,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:33:53,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:33:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:33:53,173 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:53,224 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2024-10-23 22:33:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:33:53,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-23 22:33:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:53,235 INFO L225 Difference]: With dead ends: 50 [2024-10-23 22:33:53,235 INFO L226 Difference]: Without dead ends: 24 [2024-10-23 22:33:53,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:33:53,242 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:33:53,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:33:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-23 22:33:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-23 22:33:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 22:33:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-23 22:33:53,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-10-23 22:33:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:53,284 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-23 22:33:53,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-23 22:33:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-23 22:33:53,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:53,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:33:53,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 22:33:53,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:53,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1660176756, now seen corresponding path program 1 times [2024-10-23 22:33:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:53,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959991624] [2024-10-23 22:33:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:33:53,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:53,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959991624] [2024-10-23 22:33:53,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959991624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:53,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:53,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:53,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412311719] [2024-10-23 22:33:53,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:53,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:53,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:53,528 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:53,573 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-23 22:33:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-23 22:33:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:53,576 INFO L225 Difference]: With dead ends: 36 [2024-10-23 22:33:53,576 INFO L226 Difference]: Without dead ends: 28 [2024-10-23 22:33:53,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:53,578 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:33:53,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:33:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-23 22:33:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-23 22:33:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:33:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-23 22:33:53,590 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2024-10-23 22:33:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:53,591 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-23 22:33:53,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-23 22:33:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-23 22:33:53,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:53,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:33:53,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 22:33:53,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:53,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1141436138, now seen corresponding path program 1 times [2024-10-23 22:33:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31190783] [2024-10-23 22:33:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:33:53,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:53,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31190783] [2024-10-23 22:33:53,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31190783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:53,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:53,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915208242] [2024-10-23 22:33:53,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:53,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:53,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:53,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:53,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:53,791 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:53,852 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-23 22:33:53,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:53,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-23 22:33:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:53,854 INFO L225 Difference]: With dead ends: 40 [2024-10-23 22:33:53,854 INFO L226 Difference]: Without dead ends: 32 [2024-10-23 22:33:53,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:53,857 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 22:33:53,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:33:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-23 22:33:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-23 22:33:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:33:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-23 22:33:53,868 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2024-10-23 22:33:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:53,869 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-23 22:33:53,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-23 22:33:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-23 22:33:53,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:53,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:33:53,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 22:33:53,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:53,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:53,872 INFO L85 PathProgramCache]: Analyzing trace with hash -731973192, now seen corresponding path program 1 times [2024-10-23 22:33:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:53,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402438694] [2024-10-23 22:33:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:33:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402438694] [2024-10-23 22:33:54,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402438694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:54,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:54,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396826158] [2024-10-23 22:33:54,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:54,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:54,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:54,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:54,010 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:54,052 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-23 22:33:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:54,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-23 22:33:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:54,054 INFO L225 Difference]: With dead ends: 40 [2024-10-23 22:33:54,054 INFO L226 Difference]: Without dead ends: 32 [2024-10-23 22:33:54,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:54,056 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:33:54,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:33:54,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-23 22:33:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-23 22:33:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:33:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-23 22:33:54,063 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 16 [2024-10-23 22:33:54,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:54,063 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-23 22:33:54,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-23 22:33:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-23 22:33:54,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:54,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:33:54,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 22:33:54,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:54,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash 436592986, now seen corresponding path program 1 times [2024-10-23 22:33:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568818279] [2024-10-23 22:33:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:33:54,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568818279] [2024-10-23 22:33:54,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568818279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:54,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:54,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821218029] [2024-10-23 22:33:54,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:54,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:54,217 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:54,262 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-23 22:33:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:54,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-23 22:33:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:54,264 INFO L225 Difference]: With dead ends: 40 [2024-10-23 22:33:54,265 INFO L226 Difference]: Without dead ends: 32 [2024-10-23 22:33:54,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:54,266 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:33:54,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:33:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-23 22:33:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-23 22:33:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:33:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-23 22:33:54,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2024-10-23 22:33:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:54,280 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-23 22:33:54,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:33:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-23 22:33:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-23 22:33:54,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:54,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:33:54,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 22:33:54,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:54,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1370861477, now seen corresponding path program 1 times [2024-10-23 22:33:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:54,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852477239] [2024-10-23 22:33:54,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:54,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:33:54,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 22:33:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:33:54,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-23 22:33:54,341 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 22:33:54,342 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 22:33:54,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 22:33:54,350 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-23 22:33:54,372 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 22:33:54,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:33:54 BoogieIcfgContainer [2024-10-23 22:33:54,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 22:33:54,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 22:33:54,376 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 22:33:54,376 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 22:33:54,376 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:52" (3/4) ... [2024-10-23 22:33:54,381 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-23 22:33:54,382 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 22:33:54,383 INFO L158 Benchmark]: Toolchain (without parser) took 2428.58ms. Allocated memory is still 182.5MB. Free memory was 113.8MB in the beginning and 131.0MB in the end (delta: -17.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:54,383 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:54,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.98ms. Allocated memory is still 182.5MB. Free memory was 113.6MB in the beginning and 100.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 22:33:54,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.32ms. Allocated memory is still 182.5MB. Free memory was 100.6MB in the beginning and 99.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:33:54,384 INFO L158 Benchmark]: Boogie Preprocessor took 61.14ms. Allocated memory is still 182.5MB. Free memory was 98.9MB in the beginning and 96.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:33:54,384 INFO L158 Benchmark]: RCFGBuilder took 497.94ms. Allocated memory is still 182.5MB. Free memory was 96.8MB in the beginning and 146.3MB in the end (delta: -49.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-10-23 22:33:54,384 INFO L158 Benchmark]: TraceAbstraction took 1541.15ms. Allocated memory is still 182.5MB. Free memory was 146.3MB in the beginning and 132.0MB in the end (delta: 14.3MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-23 22:33:54,385 INFO L158 Benchmark]: Witness Printer took 6.78ms. Allocated memory is still 182.5MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:54,386 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.15ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.98ms. Allocated memory is still 182.5MB. Free memory was 113.6MB in the beginning and 100.8MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.32ms. Allocated memory is still 182.5MB. Free memory was 100.6MB in the beginning and 99.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.14ms. Allocated memory is still 182.5MB. Free memory was 98.9MB in the beginning and 96.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 497.94ms. Allocated memory is still 182.5MB. Free memory was 96.8MB in the beginning and 146.3MB in the end (delta: -49.4MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1541.15ms. Allocated memory is still 182.5MB. Free memory was 146.3MB in the beginning and 132.0MB in the end (delta: 14.3MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Witness Printer took 6.78ms. Allocated memory is still 182.5MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 72]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someUnaryFLOAToperation at line 67. Possible FailurePath: [L66] float x = 0.0f; [L67] float y = -0.0f; [L68] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0] [L15] __uint32_t w; VAL [\old(x)=0, x=0] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=0, w=2139095041, x=0] [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=0, w=2139095041, x=0] [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=0, w=2139095041, x=0] [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; VAL [\old(x)=0, \result=0, x=0] [L38] RET, EXPR __fpclassify_float(x) VAL [x=0] [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; VAL [\result=2139095050, x=0] [L68] RET, EXPR fmin_float(x, y) [L68] float res = fmin_float(x, y); [L71] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=2139095050] [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L72] reach_error() VAL [res=2139095050] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 474 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 148 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-23 22:33:54,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c -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 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 22:33:56,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:33:56,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-23 22:33:56,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:33:56,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:33:56,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:33:56,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:33:56,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:33:56,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:33:56,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:33:56,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:33:56,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:33:56,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:33:56,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:33:56,691 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:33:56,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:33:56,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:33:56,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:33:56,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:33:56,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:33:56,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:33:56,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:33:56,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:33:56,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-23 22:33:56,700 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-23 22:33:56,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:33:56,700 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-23 22:33:56,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:33:56,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:33:56,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:33:56,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:33:56,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:33:56,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:33:56,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:33:56,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:56,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:33:56,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:33:56,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:33:56,703 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-23 22:33:56,704 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-23 22:33:56,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:33:56,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:33:56,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:33:56,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:33:56,705 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-23 22:33:56,705 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 -> 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 [2024-10-23 22:33:57,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:33:57,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:33:57,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:33:57,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:33:57,073 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:33:57,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-10-23 22:33:58,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:33:58,840 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:33:58,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-10-23 22:33:58,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7b78336/9b374dfd28d341f2a52413b26aef5803/FLAG8d2c06ae7 [2024-10-23 22:33:58,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7b78336/9b374dfd28d341f2a52413b26aef5803 [2024-10-23 22:33:58,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:33:58,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:33:58,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:58,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:33:58,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:33:58,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:58" (1/1) ... [2024-10-23 22:33:58,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b933074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:58, skipping insertion in model container [2024-10-23 22:33:58,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:58" (1/1) ... [2024-10-23 22:33:58,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:33:59,107 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c[1656,1669] [2024-10-23 22:33:59,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:59,125 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 22:33:59,156 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c[1656,1669] [2024-10-23 22:33:59,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:59,176 INFO L204 MainTranslator]: Completed translation [2024-10-23 22:33:59,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59 WrapperNode [2024-10-23 22:33:59,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:59,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 22:33:59,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 22:33:59,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 22:33:59,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,221 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-10-23 22:33:59,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 22:33:59,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 22:33:59,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 22:33:59,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 22:33:59,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,254 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-23 22:33:59,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 22:33:59,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 22:33:59,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 22:33:59,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 22:33:59,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:59,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 22:33:59,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 22:33:59,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 22:33:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 22:33:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-23 22:33:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-23 22:33:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-23 22:33:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 22:33:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-23 22:33:59,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-23 22:33:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-23 22:33:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-23 22:33:59,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-23 22:33:59,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 22:33:59,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 22:33:59,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-23 22:33:59,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-23 22:33:59,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-23 22:33:59,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 22:33:59,497 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 22:33:59,499 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 22:33:59,729 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-23 22:33:59,729 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 22:33:59,770 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 22:33:59,771 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-23 22:33:59,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:59 BoogieIcfgContainer [2024-10-23 22:33:59,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 22:33:59,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 22:33:59,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 22:33:59,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 22:33:59,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:33:58" (1/3) ... [2024-10-23 22:33:59,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7065bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:33:59, skipping insertion in model container [2024-10-23 22:33:59,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (2/3) ... [2024-10-23 22:33:59,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7065bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:33:59, skipping insertion in model container [2024-10-23 22:33:59,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:59" (3/3) ... [2024-10-23 22:33:59,783 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2024-10-23 22:33:59,800 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 22:33:59,800 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 22:33:59,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 22:33:59,877 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;@525d3614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 22:33:59,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 22:33:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 22:33:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-23 22:33:59,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:59,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:33:59,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:59,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:59,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1087397120, now seen corresponding path program 1 times [2024-10-23 22:33:59,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:33:59,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240691394] [2024-10-23 22:33:59,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:59,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:33:59,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:33:59,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:33:59,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-23 22:33:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:59,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-23 22:33:59,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:34:00,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:00,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:00,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240691394] [2024-10-23 22:34:00,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240691394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:00,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:00,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 22:34:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380768032] [2024-10-23 22:34:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:00,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 22:34:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 22:34:00,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 22:34:00,058 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:34:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:00,087 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2024-10-23 22:34:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 22:34:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-23 22:34:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:00,098 INFO L225 Difference]: With dead ends: 46 [2024-10-23 22:34:00,098 INFO L226 Difference]: Without dead ends: 22 [2024-10-23 22:34:00,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 22:34:00,106 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:00,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-23 22:34:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-23 22:34:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 22:34:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-23 22:34:00,145 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2024-10-23 22:34:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:00,146 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-23 22:34:00,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:34:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-23 22:34:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-23 22:34:00,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:00,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:34:00,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-23 22:34:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:00,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:00,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:00,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1335499105, now seen corresponding path program 1 times [2024-10-23 22:34:00,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:00,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334598419] [2024-10-23 22:34:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:00,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:00,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:00,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-23 22:34:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:00,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:00,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:34:00,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:00,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334598419] [2024-10-23 22:34:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334598419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:00,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:00,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35263238] [2024-10-23 22:34:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:00,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:00,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:00,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:00,496 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:34:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:00,531 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-10-23 22:34:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:00,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-23 22:34:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:00,535 INFO L225 Difference]: With dead ends: 33 [2024-10-23 22:34:00,535 INFO L226 Difference]: Without dead ends: 25 [2024-10-23 22:34:00,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:00,537 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:00,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-23 22:34:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-23 22:34:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:34:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-23 22:34:00,549 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2024-10-23 22:34:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:00,550 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-23 22:34:00,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:34:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-10-23 22:34:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-23 22:34:00,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:00,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:34:00,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-23 22:34:00,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:00,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:00,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash -710780355, now seen corresponding path program 1 times [2024-10-23 22:34:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:00,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401408465] [2024-10-23 22:34:00,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:00,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:00,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:00,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:00,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-23 22:34:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:00,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-23 22:34:00,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:34:01,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:01,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:01,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401408465] [2024-10-23 22:34:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401408465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:01,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 22:34:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308920346] [2024-10-23 22:34:01,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:01,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 22:34:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 22:34:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:34:01,006 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:34:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:01,305 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-10-23 22:34:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 22:34:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-23 22:34:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:01,306 INFO L225 Difference]: With dead ends: 46 [2024-10-23 22:34:01,306 INFO L226 Difference]: Without dead ends: 24 [2024-10-23 22:34:01,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-23 22:34:01,307 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:01,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 54 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 22:34:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-23 22:34:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-23 22:34:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 22:34:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-23 22:34:01,316 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 14 [2024-10-23 22:34:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:01,317 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-23 22:34:01,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:34:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-23 22:34:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-23 22:34:01,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:01,318 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:34:01,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:01,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:01,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:01,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1234767684, now seen corresponding path program 1 times [2024-10-23 22:34:01,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:01,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332802188] [2024-10-23 22:34:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:01,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:01,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:01,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:01,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-23 22:34:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:01,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:01,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:34:01,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:01,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:01,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332802188] [2024-10-23 22:34:01,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332802188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:01,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569166299] [2024-10-23 22:34:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:01,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:01,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:01,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:01,635 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:34:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:01,673 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-23 22:34:01,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:01,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-23 22:34:01,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:01,675 INFO L225 Difference]: With dead ends: 33 [2024-10-23 22:34:01,675 INFO L226 Difference]: Without dead ends: 25 [2024-10-23 22:34:01,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:01,678 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:01,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-23 22:34:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-23 22:34:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 22:34:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-10-23 22:34:01,684 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 21 [2024-10-23 22:34:01,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:01,685 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-23 22:34:01,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:34:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-10-23 22:34:01,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-23 22:34:01,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:01,686 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:34:01,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:01,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1232920642, now seen corresponding path program 1 times [2024-10-23 22:34:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:01,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523552653] [2024-10-23 22:34:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:01,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:01,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:01,889 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:01,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-23 22:34:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:01,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-23 22:34:01,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:34:02,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:02,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:02,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523552653] [2024-10-23 22:34:02,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523552653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:02,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:02,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:34:02,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262413730] [2024-10-23 22:34:02,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:02,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:34:02,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:02,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:34:02,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:34:02,031 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:34:02,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:02,073 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-10-23 22:34:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:34:02,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-23 22:34:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:02,074 INFO L225 Difference]: With dead ends: 30 [2024-10-23 22:34:02,074 INFO L226 Difference]: Without dead ends: 27 [2024-10-23 22:34:02,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:34:02,075 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:02,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-23 22:34:02,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-23 22:34:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 22:34:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-23 22:34:02,084 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2024-10-23 22:34:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:02,085 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-23 22:34:02,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:34:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-10-23 22:34:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-23 22:34:02,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:02,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:34:02,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-23 22:34:02,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:02,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:02,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash 527910856, now seen corresponding path program 1 times [2024-10-23 22:34:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933597805] [2024-10-23 22:34:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:02,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:02,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:02,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:02,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-23 22:34:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:02,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-23 22:34:02,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:02,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 22:34:02,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:02,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933597805] [2024-10-23 22:34:02,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933597805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:02,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:02,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 22:34:02,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434723189] [2024-10-23 22:34:02,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:02,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 22:34:02,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:02,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 22:34:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:34:02,491 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:34:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:02,635 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-23 22:34:02,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 22:34:02,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-23 22:34:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:02,636 INFO L225 Difference]: With dead ends: 35 [2024-10-23 22:34:02,636 INFO L226 Difference]: Without dead ends: 19 [2024-10-23 22:34:02,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-23 22:34:02,637 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:02,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 49 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:34:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-23 22:34:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-23 22:34:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 22:34:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-10-23 22:34:02,645 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 22 [2024-10-23 22:34:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:02,646 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-10-23 22:34:02,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:34:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-10-23 22:34:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-23 22:34:02,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:02,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:34:02,652 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 (7)] Ended with exit code 0 [2024-10-23 22:34:02,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:02,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:02,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash 118740037, now seen corresponding path program 1 times [2024-10-23 22:34:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509342122] [2024-10-23 22:34:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:02,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:02,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:02,852 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 (8)] Waiting until timeout for monitored process [2024-10-23 22:34:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:02,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-23 22:34:02,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:34:03,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:03,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509342122] [2024-10-23 22:34:03,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509342122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:03,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:03,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-23 22:34:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736316003] [2024-10-23 22:34:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:03,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-23 22:34:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:03,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-23 22:34:03,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-23 22:34:03,065 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:34:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:03,128 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-10-23 22:34:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-23 22:34:03,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-23 22:34:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:03,129 INFO L225 Difference]: With dead ends: 19 [2024-10-23 22:34:03,129 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 22:34:03,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-23 22:34:03,130 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:03,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 22:34:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 22:34:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 22:34:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 22:34:03,131 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-10-23 22:34:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:03,131 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 22:34:03,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:34:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 22:34:03,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 22:34:03,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 22:34:03,141 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 (8)] Ended with exit code 0 [2024-10-23 22:34:03,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:03,343 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:34:03,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 22:34:03,442 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 22:34:03,468 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-23 22:34:03,470 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-23 22:34:03,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:34:03 BoogieIcfgContainer [2024-10-23 22:34:03,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 22:34:03,476 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 22:34:03,476 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 22:34:03,476 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 22:34:03,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:59" (3/4) ... [2024-10-23 22:34:03,478 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 22:34:03,486 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2024-10-23 22:34:03,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-23 22:34:03,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-23 22:34:03,490 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 22:34:03,490 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 22:34:03,580 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 22:34:03,580 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 22:34:03,580 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 22:34:03,581 INFO L158 Benchmark]: Toolchain (without parser) took 4712.50ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 35.6MB in the beginning and 28.9MB in the end (delta: 6.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-23 22:34:03,581 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 46.1MB. Free memory was 25.3MB in the beginning and 25.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:34:03,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.80ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 37.8MB in the end (delta: -2.4MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-23 22:34:03,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.63ms. Allocated memory is still 65.0MB. Free memory was 37.8MB in the beginning and 36.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:34:03,582 INFO L158 Benchmark]: Boogie Preprocessor took 60.88ms. Allocated memory is still 65.0MB. Free memory was 36.1MB in the beginning and 33.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:34:03,583 INFO L158 Benchmark]: RCFGBuilder took 487.69ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 33.8MB in the beginning and 49.9MB in the end (delta: -16.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-23 22:34:03,583 INFO L158 Benchmark]: TraceAbstraction took 3700.30ms. Allocated memory is still 81.8MB. Free memory was 49.2MB in the beginning and 34.3MB in the end (delta: 14.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-23 22:34:03,583 INFO L158 Benchmark]: Witness Printer took 104.59ms. Allocated memory is still 81.8MB. Free memory was 33.7MB in the beginning and 28.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-23 22:34:03,585 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.89ms. Allocated memory is still 46.1MB. Free memory was 25.3MB in the beginning and 25.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.80ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 37.8MB in the end (delta: -2.4MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.63ms. Allocated memory is still 65.0MB. Free memory was 37.8MB in the beginning and 36.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.88ms. Allocated memory is still 65.0MB. Free memory was 36.1MB in the beginning and 33.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.69ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 33.8MB in the beginning and 49.9MB in the end (delta: -16.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3700.30ms. Allocated memory is still 81.8MB. Free memory was 49.2MB in the beginning and 34.3MB in the end (delta: 14.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Witness Printer took 104.59ms. Allocated memory is still 81.8MB. Free memory was 33.7MB in the beginning and 28.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 72]: 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 425 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 286 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 212 IncrementalHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 139 mSDtfsCounter, 212 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 120 ConstructedInterpolants, 6 QuantifiedInterpolants, 355 SizeOfPredicates, 11 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 24/24 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: 17]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-23 22:34:03,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE