./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/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/double_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 f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:49:59,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:49:59,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:49:59,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:49:59,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:49:59,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:49:59,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:49:59,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:49:59,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:49:59,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:49:59,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:49:59,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:49:59,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:49:59,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:49:59,909 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:49:59,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:49:59,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:49:59,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:49:59,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:49:59,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:49:59,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:49:59,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:49:59,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:49:59,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:49:59,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:49:59,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:49:59,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:49:59,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:49:59,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:49:59,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:49:59,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:49:59,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:49:59,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:49:59,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:49:59,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:49:59,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:49:59,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:49:59,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:49:59,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:49:59,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:49:59,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:49:59,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:49:59,917 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 -> f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 [2024-10-14 00:50:00,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:50:00,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:50:00,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:50:00,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:50:00,172 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:50:00,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-10-14 00:50:01,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:50:01,631 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:50:01,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-10-14 00:50:01,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aeae7edb/e7a9a02bbcd742069d995d26440598f4/FLAG38ebf7883 [2024-10-14 00:50:01,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aeae7edb/e7a9a02bbcd742069d995d26440598f4 [2024-10-14 00:50:01,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:50:01,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:50:01,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:50:01,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:50:01,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:50:01,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6262d4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01, skipping insertion in model container [2024-10-14 00:50:01,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:50:01,821 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/double_req_bl_1232a.c[1957,1970] [2024-10-14 00:50:01,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:50:01,833 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:50:01,854 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/double_req_bl_1232a.c[1957,1970] [2024-10-14 00:50:01,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:50:01,873 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:50:01,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01 WrapperNode [2024-10-14 00:50:01,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:50:01,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:50:01,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:50:01,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:50:01,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,900 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-10-14 00:50:01,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:50:01,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:50:01,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:50:01,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:50:01,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,926 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 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-14 00:50:01,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:50:01,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:50:01,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:50:01,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:50:01,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (1/1) ... [2024-10-14 00:50:01,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:50:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:50:01,978 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-14 00:50:01,995 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-14 00:50:02,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-14 00:50:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:50:02,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 00:50:02,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 00:50:02,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 00:50:02,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 00:50:02,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:50:02,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:50:02,310 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 00:50:02,310 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:50:02,330 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:50:02,330 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 00:50:02,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:02 BoogieIcfgContainer [2024-10-14 00:50:02,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:50:02,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:50:02,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:50:02,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:50:02,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:50:01" (1/3) ... [2024-10-14 00:50:02,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebfe340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:50:02, skipping insertion in model container [2024-10-14 00:50:02,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:01" (2/3) ... [2024-10-14 00:50:02,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebfe340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:50:02, skipping insertion in model container [2024-10-14 00:50:02,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:02" (3/3) ... [2024-10-14 00:50:02,337 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2024-10-14 00:50:02,351 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:50:02,351 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:50:02,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:50:02,397 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;@167a0e20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:50:02,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:50:02,403 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-14 00:50:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 00:50:02,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:02,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:02,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:02,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2030686387, now seen corresponding path program 1 times [2024-10-14 00:50:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:02,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90413454] [2024-10-14 00:50:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:02,591 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-14 00:50:02,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90413454] [2024-10-14 00:50:02,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90413454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:02,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:02,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:50:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316202420] [2024-10-14 00:50:02,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:02,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:50:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:02,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:50:02,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:50:02,616 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-14 00:50:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:02,649 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2024-10-14 00:50:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:50:02,651 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-14 00:50:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:02,656 INFO L225 Difference]: With dead ends: 50 [2024-10-14 00:50:02,656 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 00:50:02,658 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-14 00:50:02,661 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-14 00:50:02,662 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-14 00:50:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 00:50:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 00:50:02,684 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-14 00:50:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 00:50:02,686 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-10-14 00:50:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:02,686 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 00:50:02,686 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-14 00:50:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 00:50:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 00:50:02,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:02,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:02,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 00:50:02,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:02,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1660176756, now seen corresponding path program 1 times [2024-10-14 00:50:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:02,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137003025] [2024-10-14 00:50:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:02,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:02,937 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-14 00:50:02,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:02,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137003025] [2024-10-14 00:50:02,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137003025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:02,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:02,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136277588] [2024-10-14 00:50:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:02,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:02,939 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-14 00:50:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:02,984 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-14 00:50:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:02,987 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-14 00:50:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:02,989 INFO L225 Difference]: With dead ends: 36 [2024-10-14 00:50:02,989 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 00:50:02,989 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-14 00:50:02,991 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-14 00:50:02,991 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-14 00:50:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 00:50:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 00:50:02,998 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-14 00:50:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 00:50:02,999 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2024-10-14 00:50:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:03,000 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 00:50:03,000 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-14 00:50:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 00:50:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 00:50:03,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:03,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:03,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 00:50:03,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:03,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:03,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1141436138, now seen corresponding path program 1 times [2024-10-14 00:50:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:03,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367868717] [2024-10-14 00:50:03,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:03,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:03,115 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-14 00:50:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367868717] [2024-10-14 00:50:03,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367868717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:03,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:03,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789595058] [2024-10-14 00:50:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:03,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:03,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:03,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:03,117 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-14 00:50:03,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:03,143 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-14 00:50:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:03,144 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-14 00:50:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:03,145 INFO L225 Difference]: With dead ends: 40 [2024-10-14 00:50:03,145 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 00:50:03,145 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-14 00:50:03,146 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-14 00:50:03,146 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-14 00:50:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 00:50:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-14 00:50:03,152 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-14 00:50:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 00:50:03,152 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2024-10-14 00:50:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:03,152 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 00:50:03,153 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-14 00:50:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 00:50:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 00:50:03,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:03,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:03,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 00:50:03,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:03,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash -731973192, now seen corresponding path program 1 times [2024-10-14 00:50:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:03,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158285938] [2024-10-14 00:50:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:03,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:03,261 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-14 00:50:03,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:03,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158285938] [2024-10-14 00:50:03,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158285938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:03,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:03,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:03,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508769291] [2024-10-14 00:50:03,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:03,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:03,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:03,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:03,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:03,264 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-14 00:50:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:03,305 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-14 00:50:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:03,306 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-14 00:50:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:03,307 INFO L225 Difference]: With dead ends: 40 [2024-10-14 00:50:03,307 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 00:50:03,307 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-14 00:50:03,308 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-14 00:50:03,308 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-14 00:50:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 00:50:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-14 00:50:03,315 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-14 00:50:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 00:50:03,316 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 16 [2024-10-14 00:50:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:03,317 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 00:50:03,318 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-14 00:50:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 00:50:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 00:50:03,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:03,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:03,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 00:50:03,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:03,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash 436592986, now seen corresponding path program 1 times [2024-10-14 00:50:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:03,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385056175] [2024-10-14 00:50:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 00:50:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:03,423 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-14 00:50:03,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:50:03,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385056175] [2024-10-14 00:50:03,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385056175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:03,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:03,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113633318] [2024-10-14 00:50:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:03,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:03,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:50:03,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:03,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:03,426 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-14 00:50:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:03,468 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-14 00:50:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:03,471 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-14 00:50:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:03,472 INFO L225 Difference]: With dead ends: 40 [2024-10-14 00:50:03,472 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 00:50:03,473 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-14 00:50:03,473 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-14 00:50:03,474 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-14 00:50:03,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 00:50:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-14 00:50:03,482 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-14 00:50:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-14 00:50:03,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2024-10-14 00:50:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:03,484 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-14 00:50:03,484 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-14 00:50:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-14 00:50:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 00:50:03,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:03,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:03,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 00:50:03,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:03,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1370861477, now seen corresponding path program 1 times [2024-10-14 00:50:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:50:03,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890195727] [2024-10-14 00:50:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:50:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 00:50:03,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 00:50:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 00:50:03,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 00:50:03,554 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 00:50:03,554 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:50:03,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 00:50:03,563 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 00:50:03,582 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:50:03,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:50:03 BoogieIcfgContainer [2024-10-14 00:50:03,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:50:03,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:50:03,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:50:03,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:50:03,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:02" (3/4) ... [2024-10-14 00:50:03,594 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 00:50:03,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:50:03,598 INFO L158 Benchmark]: Toolchain (without parser) took 1945.75ms. Allocated memory is still 184.5MB. Free memory was 115.7MB in the beginning and 79.5MB in the end (delta: 36.3MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2024-10-14 00:50:03,598 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:50:03,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.44ms. Allocated memory is still 184.5MB. Free memory was 115.5MB in the beginning and 103.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 00:50:03,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.69ms. Allocated memory is still 184.5MB. Free memory was 103.2MB in the beginning and 101.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:03,601 INFO L158 Benchmark]: Boogie Preprocessor took 38.04ms. Allocated memory is still 184.5MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:03,601 INFO L158 Benchmark]: RCFGBuilder took 391.18ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 142.6MB in the end (delta: -43.0MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-10-14 00:50:03,601 INFO L158 Benchmark]: TraceAbstraction took 1258.32ms. Allocated memory is still 184.5MB. Free memory was 141.9MB in the beginning and 79.5MB in the end (delta: 62.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2024-10-14 00:50:03,601 INFO L158 Benchmark]: Witness Printer took 6.17ms. Allocated memory is still 184.5MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:50:03,603 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.44ms. Allocated memory is still 184.5MB. Free memory was 115.5MB in the beginning and 103.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.69ms. Allocated memory is still 184.5MB. Free memory was 103.2MB in the beginning and 101.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.04ms. Allocated memory is still 184.5MB. Free memory was 101.7MB in the beginning and 99.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.18ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 142.6MB in the end (delta: -43.0MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1258.32ms. Allocated memory is still 184.5MB. Free memory was 141.9MB in the beginning and 79.5MB in the end (delta: 62.4MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * Witness Printer took 6.17ms. Allocated memory is still 184.5MB. Free memory is still 79.5MB. 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: 82]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 77. Possible FailurePath: [L76] double x = 0.0; [L77] double y = -0.0; [L78] CALL, EXPR fmin_double(x, y) [L48] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L30-L31] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L33-L34] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L36-L37] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L40-L41] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L44] return 0; VAL [\old(x)=0, \result=0, x=0] [L48] RET, EXPR __fpclassify_double(x) VAL [x=0] [L48] COND TRUE __fpclassify_double(x) == 0 [L49] return y; VAL [\result=4294967306, x=0] [L78] RET, EXPR fmin_double(x, y) [L78] double res = fmin_double(x, y); [L81] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=4294967306] [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() VAL [res=4294967306] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s 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-14 00:50:03,630 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/double_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 f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:50:05,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:50:05,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 00:50:05,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:50:05,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:50:05,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:50:05,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:50:05,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:50:05,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:50:05,836 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:50:05,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:50:05,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:50:05,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:50:05,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:50:05,838 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:50:05,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:50:05,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:50:05,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:50:05,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:50:05,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:50:05,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:50:05,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:50:05,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:50:05,845 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 00:50:05,845 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 00:50:05,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:50:05,846 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 00:50:05,846 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:50:05,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:50:05,846 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:50:05,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:50:05,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:50:05,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:50:05,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:50:05,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:50:05,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:50:05,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:50:05,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:50:05,855 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 00:50:05,856 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 00:50:05,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:50:05,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:50:05,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:50:05,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:50:05,859 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 00:50:05,860 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 -> f5978e6794574f24e5282dc6c0759b72c8b7ad9dd0acf1cc3c9d6f2352537904 [2024-10-14 00:50:06,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:50:06,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:50:06,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:50:06,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:50:06,137 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:50:06,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-10-14 00:50:07,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:50:07,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:50:07,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2024-10-14 00:50:07,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76509e5f0/99d83c4b4d2c4e62b205bba38161db7f/FLAGb04119966 [2024-10-14 00:50:07,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76509e5f0/99d83c4b4d2c4e62b205bba38161db7f [2024-10-14 00:50:07,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:50:07,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:50:07,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:50:07,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:50:07,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:50:07,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:50:07" (1/1) ... [2024-10-14 00:50:07,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a69ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:07, skipping insertion in model container [2024-10-14 00:50:07,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:50:07" (1/1) ... [2024-10-14 00:50:07,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:50:07,979 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/double_req_bl_1232a.c[1957,1970] [2024-10-14 00:50:07,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:50:08,000 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:50:08,028 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/double_req_bl_1232a.c[1957,1970] [2024-10-14 00:50:08,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:50:08,054 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:50:08,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08 WrapperNode [2024-10-14 00:50:08,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:50:08,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:50:08,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:50:08,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:50:08,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,097 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-10-14 00:50:08,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:50:08,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:50:08,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:50:08,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:50:08,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,141 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 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-14 00:50:08,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:50:08,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:50:08,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:50:08,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:50:08,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (1/1) ... [2024-10-14 00:50:08,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:50:08,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:50:08,205 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-14 00:50:08,209 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-14 00:50:08,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:50:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 00:50:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 00:50:08,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-14 00:50:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 00:50:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 00:50:08,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 00:50:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 00:50:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-14 00:50:08,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-14 00:50:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 00:50:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 00:50:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 00:50:08,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:50:08,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:50:08,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 00:50:08,342 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:50:08,345 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:50:08,590 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-14 00:50:08,593 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:50:08,631 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:50:08,635 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 00:50:08,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:08 BoogieIcfgContainer [2024-10-14 00:50:08,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:50:08,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:50:08,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:50:08,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:50:08,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:50:07" (1/3) ... [2024-10-14 00:50:08,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d6a28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:50:08, skipping insertion in model container [2024-10-14 00:50:08,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:50:08" (2/3) ... [2024-10-14 00:50:08,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d6a28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:50:08, skipping insertion in model container [2024-10-14 00:50:08,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:08" (3/3) ... [2024-10-14 00:50:08,647 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2024-10-14 00:50:08,662 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:50:08,662 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:50:08,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:50:08,745 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;@5a2d6c51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:50:08,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:50:08,749 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-14 00:50:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 00:50:08,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:08,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:08,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:08,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1087397120, now seen corresponding path program 1 times [2024-10-14 00:50:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:08,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576580649] [2024-10-14 00:50:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:08,773 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-14 00:50:08,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:08,776 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-14 00:50:08,778 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-14 00:50:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:08,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 00:50:08,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:08,883 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-14 00:50:08,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:08,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:08,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576580649] [2024-10-14 00:50:08,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576580649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:08,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:08,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:50:08,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6623134] [2024-10-14 00:50:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:08,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 00:50:08,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:08,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 00:50:08,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:50:08,921 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-14 00:50:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:08,948 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2024-10-14 00:50:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 00:50:08,951 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-14 00:50:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:08,958 INFO L225 Difference]: With dead ends: 46 [2024-10-14 00:50:08,958 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 00:50:08,961 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-14 00:50:08,964 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-14 00:50:08,966 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-14 00:50:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 00:50:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 00:50:08,994 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-14 00:50:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-14 00:50:08,997 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2024-10-14 00:50:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:08,998 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-14 00:50:08,999 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-14 00:50:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-14 00:50:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 00:50:09,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:09,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:09,004 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-14 00:50:09,201 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-14 00:50:09,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:09,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1335499105, now seen corresponding path program 1 times [2024-10-14 00:50:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922145303] [2024-10-14 00:50:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:09,203 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-14 00:50:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:09,205 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-14 00:50:09,207 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-14 00:50:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:09,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:50:09,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:09,286 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-14 00:50:09,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:09,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:09,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922145303] [2024-10-14 00:50:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922145303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:50:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801599967] [2024-10-14 00:50:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:09,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:50:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:09,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:50:09,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:09,289 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-14 00:50:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:09,318 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-10-14 00:50:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:50:09,318 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-14 00:50:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:09,320 INFO L225 Difference]: With dead ends: 33 [2024-10-14 00:50:09,320 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 00:50:09,321 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-14 00:50:09,322 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-14 00:50:09,322 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-14 00:50:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 00:50:09,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 00:50:09,327 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-14 00:50:09,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-14 00:50:09,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2024-10-14 00:50:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:09,328 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-14 00:50:09,328 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-14 00:50:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-10-14 00:50:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 00:50:09,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:09,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:09,335 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-14 00:50:09,532 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-14 00:50:09,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:09,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:09,546 INFO L85 PathProgramCache]: Analyzing trace with hash -710780355, now seen corresponding path program 1 times [2024-10-14 00:50:09,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:09,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975450021] [2024-10-14 00:50:09,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:09,547 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-14 00:50:09,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:09,553 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-14 00:50:09,554 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-14 00:50:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:09,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 00:50:09,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:09,810 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-14 00:50:09,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:09,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975450021] [2024-10-14 00:50:09,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975450021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:09,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:09,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 00:50:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948929716] [2024-10-14 00:50:09,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:09,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 00:50:09,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:09,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 00:50:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:50:09,813 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-14 00:50:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:10,082 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-10-14 00:50:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 00:50:10,083 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-14 00:50:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:10,084 INFO L225 Difference]: With dead ends: 50 [2024-10-14 00:50:10,084 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 00:50:10,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 00:50:10,085 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:10,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 00:50:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 00:50:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-14 00:50:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-14 00:50:10,091 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-10-14 00:50:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:10,091 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-14 00:50:10,091 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-14 00:50:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-14 00:50:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 00:50:10,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:10,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:10,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 00:50:10,295 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-14 00:50:10,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:10,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash -143061541, now seen corresponding path program 1 times [2024-10-14 00:50:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:10,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371258901] [2024-10-14 00:50:10,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:10,296 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-14 00:50:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:10,300 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-14 00:50:10,302 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-14 00:50:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:10,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:50:10,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:10,353 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-14 00:50:10,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:10,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371258901] [2024-10-14 00:50:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371258901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:10,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:50:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860507376] [2024-10-14 00:50:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:50:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:10,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:50:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:10,356 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-14 00:50:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:10,380 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-10-14 00:50:10,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:50:10,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-14 00:50:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:10,381 INFO L225 Difference]: With dead ends: 38 [2024-10-14 00:50:10,381 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 00:50:10,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-14 00:50:10,382 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:10,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 00:50:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-14 00:50:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-14 00:50:10,386 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 15 [2024-10-14 00:50:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:10,387 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-14 00:50:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-14 00:50:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-14 00:50:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 00:50:10,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:10,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:10,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 00:50:10,588 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-14 00:50:10,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:10,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1342340743, now seen corresponding path program 1 times [2024-10-14 00:50:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:10,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373074557] [2024-10-14 00:50:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:10,590 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-14 00:50:10,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:10,591 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-14 00:50:10,592 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-14 00:50:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:10,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 00:50:10,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:10,767 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-14 00:50:10,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:10,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:10,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373074557] [2024-10-14 00:50:10,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373074557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 00:50:10,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806200375] [2024-10-14 00:50:10,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:10,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 00:50:10,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:10,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 00:50:10,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:50:10,772 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-14 00:50:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:11,010 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-10-14 00:50:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 00:50:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-14 00:50:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:11,012 INFO L225 Difference]: With dead ends: 50 [2024-10-14 00:50:11,013 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 00:50:11,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 00:50:11,014 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:11,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 00:50:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 00:50:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-14 00:50:11,019 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-14 00:50:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-14 00:50:11,020 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2024-10-14 00:50:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:11,020 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-14 00:50:11,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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-14 00:50:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-14 00:50:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 00:50:11,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:11,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:11,032 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-14 00:50:11,225 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-14 00:50:11,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:11,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1234767684, now seen corresponding path program 1 times [2024-10-14 00:50:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340786755] [2024-10-14 00:50:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:11,227 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-14 00:50:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:11,230 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-14 00:50:11,234 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-14 00:50:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:11,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:50:11,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:11,315 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-14 00:50:11,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:11,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:11,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340786755] [2024-10-14 00:50:11,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340786755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:11,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:11,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:50:11,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993507740] [2024-10-14 00:50:11,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:11,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:50:11,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:11,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:50:11,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:11,319 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-14 00:50:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:11,341 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-14 00:50:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:50:11,342 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-14 00:50:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:11,342 INFO L225 Difference]: With dead ends: 35 [2024-10-14 00:50:11,343 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 00:50:11,344 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-14 00:50:11,344 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-14 00:50:11,344 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-14 00:50:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 00:50:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 00:50:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-14 00:50:11,354 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 21 [2024-10-14 00:50:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:11,354 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-14 00:50:11,354 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-14 00:50:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-14 00:50:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 00:50:11,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:11,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:11,363 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-14 00:50:11,558 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-14 00:50:11,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:11,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1232920642, now seen corresponding path program 1 times [2024-10-14 00:50:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:11,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841195855] [2024-10-14 00:50:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:11,561 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-14 00:50:11,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:11,562 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-14 00:50:11,564 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-14 00:50:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:11,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 00:50:11,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:11,663 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-14 00:50:11,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:11,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:11,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841195855] [2024-10-14 00:50:11,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841195855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:11,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:11,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 00:50:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983184007] [2024-10-14 00:50:11,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:11,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 00:50:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:11,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 00:50:11,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 00:50:11,665 INFO L87 Difference]: Start difference. First operand 27 states and 34 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-14 00:50:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:11,698 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-10-14 00:50:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 00:50:11,699 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-14 00:50:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:11,699 INFO L225 Difference]: With dead ends: 32 [2024-10-14 00:50:11,699 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 00:50:11,700 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-14 00:50:11,700 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-14 00:50:11,700 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-14 00:50:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 00:50:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 00:50:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-14 00:50:11,705 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 21 [2024-10-14 00:50:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:11,705 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-14 00:50:11,705 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-14 00:50:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-14 00:50:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 00:50:11,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:11,706 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-14 00:50:11,714 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 (8)] Forceful destruction successful, exit code 0 [2024-10-14 00:50:11,909 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-14 00:50:11,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:11,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash 527910856, now seen corresponding path program 1 times [2024-10-14 00:50:11,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:11,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45199082] [2024-10-14 00:50:11,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:11,911 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-14 00:50:11,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:11,915 INFO L229 MonitoredProcess]: Starting monitored process 9 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-14 00:50:11,916 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 (9)] Waiting until timeout for monitored process [2024-10-14 00:50:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:11,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 00:50:11,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:12,101 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-14 00:50:12,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:12,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45199082] [2024-10-14 00:50:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45199082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:12,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:12,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 00:50:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200704046] [2024-10-14 00:50:12,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:12,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 00:50:12,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:12,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 00:50:12,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:50:12,104 INFO L87 Difference]: Start difference. First operand 29 states and 36 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-14 00:50:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:12,273 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-14 00:50:12,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 00:50:12,273 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-14 00:50:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:12,274 INFO L225 Difference]: With dead ends: 42 [2024-10-14 00:50:12,274 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 00:50:12,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 00:50:12,274 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:50:12,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 62 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:50:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 00:50:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 00:50:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 00:50:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-14 00:50:12,279 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-10-14 00:50:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:12,279 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-14 00:50:12,279 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-14 00:50:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-14 00:50:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 00:50:12,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:12,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:12,286 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 (9)] Ended with exit code 0 [2024-10-14 00:50:12,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-14 00:50:12,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:12,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2012644792, now seen corresponding path program 1 times [2024-10-14 00:50:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781568623] [2024-10-14 00:50:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:12,482 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-14 00:50:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:12,485 INFO L229 MonitoredProcess]: Starting monitored process 10 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-14 00:50:12,486 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 (10)] Waiting until timeout for monitored process [2024-10-14 00:50:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:12,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 00:50:12,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:12,580 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-14 00:50:12,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:12,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781568623] [2024-10-14 00:50:12,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781568623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:12,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:12,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 00:50:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513961342] [2024-10-14 00:50:12,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:12,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:50:12,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:12,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:50:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:50:12,582 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 00:50:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:12,610 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-14 00:50:12,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:50:12,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2024-10-14 00:50:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:12,611 INFO L225 Difference]: With dead ends: 38 [2024-10-14 00:50:12,611 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 00:50:12,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-14 00:50:12,612 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 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-14 00:50:12,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 00:50:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-14 00:50:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-14 00:50:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-14 00:50:12,616 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 23 [2024-10-14 00:50:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:12,616 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-14 00:50:12,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-14 00:50:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-14 00:50:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 00:50:12,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:12,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:12,625 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 (10)] Forceful destruction successful, exit code 0 [2024-10-14 00:50:12,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-14 00:50:12,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:12,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:12,821 INFO L85 PathProgramCache]: Analyzing trace with hash -823936700, now seen corresponding path program 1 times [2024-10-14 00:50:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:12,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027984459] [2024-10-14 00:50:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:12,822 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-14 00:50:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:12,824 INFO L229 MonitoredProcess]: Starting monitored process 11 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-14 00:50:12,826 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 (11)] Waiting until timeout for monitored process [2024-10-14 00:50:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:12,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 00:50:12,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:13,002 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-14 00:50:13,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:13,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:13,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027984459] [2024-10-14 00:50:13,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027984459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:13,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 00:50:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718038595] [2024-10-14 00:50:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:13,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 00:50:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 00:50:13,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:50:13,004 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-14 00:50:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:13,209 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-14 00:50:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 00:50:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 24 [2024-10-14 00:50:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:13,210 INFO L225 Difference]: With dead ends: 35 [2024-10-14 00:50:13,210 INFO L226 Difference]: Without dead ends: 21 [2024-10-14 00:50:13,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 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-14 00:50:13,210 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 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-14 00:50:13,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 49 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 00:50:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-14 00:50:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-14 00:50:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-14 00:50:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-14 00:50:13,217 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 24 [2024-10-14 00:50:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:13,217 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-14 00:50:13,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-14 00:50:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-14 00:50:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 00:50:13,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:50:13,218 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-14 00:50:13,225 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 (11)] Ended with exit code 0 [2024-10-14 00:50:13,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-14 00:50:13,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:50:13,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:50:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash 118740037, now seen corresponding path program 1 times [2024-10-14 00:50:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 00:50:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777436643] [2024-10-14 00:50:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:50:13,420 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-14 00:50:13,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 00:50:13,424 INFO L229 MonitoredProcess]: Starting monitored process 12 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-14 00:50:13,427 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 (12)] Waiting until timeout for monitored process [2024-10-14 00:50:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:50:13,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 00:50:13,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:50:13,590 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-14 00:50:13,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:50:13,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 00:50:13,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777436643] [2024-10-14 00:50:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777436643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:50:13,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:50:13,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 00:50:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831944379] [2024-10-14 00:50:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:50:13,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 00:50:13,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 00:50:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 00:50:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 00:50:13,603 INFO L87 Difference]: Start difference. First operand 21 states and 22 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-14 00:50:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:50:13,658 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-10-14 00:50:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 00:50:13,659 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-14 00:50:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:50:13,660 INFO L225 Difference]: With dead ends: 21 [2024-10-14 00:50:13,660 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 00:50:13,660 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-14 00:50:13,660 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 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-14 00:50:13,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:50:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 00:50:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 00:50:13,661 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-14 00:50:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 00:50:13,661 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-10-14 00:50:13,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:50:13,661 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 00:50:13,661 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-14 00:50:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 00:50:13,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 00:50:13,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 00:50:13,670 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 (12)] Ended with exit code 0 [2024-10-14 00:50:13,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-14 00:50:13,869 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 00:50:13,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 00:50:14,077 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 00:50:14,118 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~64 [2024-10-14 00:50:14,127 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:50:14,127 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:50:14,127 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 00:50:14,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:50:14 BoogieIcfgContainer [2024-10-14 00:50:14,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 00:50:14,128 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 00:50:14,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 00:50:14,129 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 00:50:14,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:50:08" (3/4) ... [2024-10-14 00:50:14,131 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 00:50:14,133 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-10-14 00:50:14,138 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-10-14 00:50:14,139 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-14 00:50:14,139 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 00:50:14,139 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 00:50:14,163 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2024-10-14 00:50:14,176 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2024-10-14 00:50:14,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 00:50:14,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 00:50:14,223 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 00:50:14,224 INFO L158 Benchmark]: Toolchain (without parser) took 6484.28ms. Allocated memory was 58.7MB in the beginning and 88.1MB in the end (delta: 29.4MB). Free memory was 36.9MB in the beginning and 58.2MB in the end (delta: -21.3MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2024-10-14 00:50:14,224 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory was 33.3MB in the beginning and 33.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:50:14,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.06ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 36.8MB in the beginning and 54.4MB in the end (delta: -17.6MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-10-14 00:50:14,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.96ms. Allocated memory is still 73.4MB. Free memory was 54.4MB in the beginning and 52.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 00:50:14,225 INFO L158 Benchmark]: Boogie Preprocessor took 70.20ms. Allocated memory is still 73.4MB. Free memory was 52.7MB in the beginning and 50.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 00:50:14,225 INFO L158 Benchmark]: RCFGBuilder took 462.94ms. Allocated memory is still 73.4MB. Free memory was 50.5MB in the beginning and 34.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 00:50:14,225 INFO L158 Benchmark]: TraceAbstraction took 5490.38ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 62.9MB in the end (delta: -29.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-10-14 00:50:14,226 INFO L158 Benchmark]: Witness Printer took 95.13ms. Allocated memory is still 88.1MB. Free memory was 62.9MB in the beginning and 58.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 00:50:14,227 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory was 33.3MB in the beginning and 33.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.06ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 36.8MB in the beginning and 54.4MB in the end (delta: -17.6MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.96ms. Allocated memory is still 73.4MB. Free memory was 54.4MB in the beginning and 52.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.20ms. Allocated memory is still 73.4MB. Free memory was 52.7MB in the beginning and 50.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 462.94ms. Allocated memory is still 73.4MB. Free memory was 50.5MB in the beginning and 34.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5490.38ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 62.9MB in the end (delta: -29.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Witness Printer took 95.13ms. Allocated memory is still 88.1MB. Free memory was 62.9MB in the beginning and 58.2MB in the end (delta: 4.7MB). 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: Missing case for function ~Pluszero~64 - 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 - 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: 82]: 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: 5.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 380 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 231 mSDtfsCounter, 380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=7, InterpolantAutomatonStates: 57, 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, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 194 ConstructedInterpolants, 26 QuantifiedInterpolants, 835 SizeOfPredicates, 17 NumberOfNonLiveVariables, 734 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 36/36 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: 23]: Loop Invariant Derived loop invariant: (\old(x) == x) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-14 00:50:14,259 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