./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_1232b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232b.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 e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 22:24:53,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:24:53,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 22:24:53,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:24:53,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:24:53,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:24:53,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:24:53,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:24:53,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:24:53,810 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:24:53,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:24:53,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:24:53,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:24:53,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:24:53,814 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:24:53,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:24:53,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:24:53,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:24:53,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 22:24:53,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:24:53,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:24:53,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:24:53,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:24:53,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:24:53,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:24:53,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:24:53,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:24:53,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:24:53,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:24:53,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:24:53,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:24:53,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:24:53,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:24:53,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:24:53,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:24:53,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:24:53,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 22:24:53,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 22:24:53,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:24:53,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:24:53,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:24:53,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:24:53,827 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 -> e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 [2024-10-23 22:24:54,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:24:54,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:24:54,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:24:54,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:24:54,147 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:24:54,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2024-10-23 22:24:55,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:24:55,786 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:24:55,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2024-10-23 22:24:55,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f48b27f/a366cf604c924023b83e6459bb27a557/FLAGa96565b0a [2024-10-23 22:24:55,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1f48b27f/a366cf604c924023b83e6459bb27a557 [2024-10-23 22:24:55,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:24:55,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:24:55,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:24:55,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:24:55,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:24:55,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:24:55" (1/1) ... [2024-10-23 22:24:55,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd714f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:55, skipping insertion in model container [2024-10-23 22:24:55,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:24:55" (1/1) ... [2024-10-23 22:24:55,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:24:56,053 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_1232b.c[1958,1971] [2024-10-23 22:24:56,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:24:56,068 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 22:24:56,098 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_1232b.c[1958,1971] [2024-10-23 22:24:56,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:24:56,123 INFO L204 MainTranslator]: Completed translation [2024-10-23 22:24:56,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56 WrapperNode [2024-10-23 22:24:56,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 22:24:56,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 22:24:56,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 22:24:56,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 22:24:56,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,164 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-10-23 22:24:56,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 22:24:56,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 22:24:56,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 22:24:56,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 22:24:56,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,202 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-23 22:24:56,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 22:24:56,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 22:24:56,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 22:24:56,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 22:24:56,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (1/1) ... [2024-10-23 22:24:56,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:24:56,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 22:24:56,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 22:24:56,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 22:24:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 22:24:56,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 22:24:56,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 22:24:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-23 22:24:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 22:24:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-23 22:24:56,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-23 22:24:56,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-23 22:24:56,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-23 22:24:56,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-23 22:24:56,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 22:24:56,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 22:24:56,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 22:24:56,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 22:24:56,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-23 22:24:56,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 22:24:56,408 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 22:24:56,410 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 22:24:56,660 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-23 22:24:56,661 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 22:24:56,686 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 22:24:56,697 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-23 22:24:56,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:24:56 BoogieIcfgContainer [2024-10-23 22:24:56,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 22:24:56,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 22:24:56,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 22:24:56,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 22:24:56,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:24:55" (1/3) ... [2024-10-23 22:24:56,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fd1d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:24:56, skipping insertion in model container [2024-10-23 22:24:56,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:24:56" (2/3) ... [2024-10-23 22:24:56,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10fd1d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:24:56, skipping insertion in model container [2024-10-23 22:24:56,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:24:56" (3/3) ... [2024-10-23 22:24:56,708 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b.c [2024-10-23 22:24:56,723 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 22:24:56,723 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 22:24:56,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 22:24:56,780 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;@20f33e91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 22:24:56,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 22:24:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 22:24:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-23 22:24:56,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:24:56,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:24:56,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:24:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:24:56,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2030686387, now seen corresponding path program 1 times [2024-10-23 22:24:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:24:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515276972] [2024-10-23 22:24:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:24:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:24:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:57,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:24:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:24:57,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:24:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515276972] [2024-10-23 22:24:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515276972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:24:57,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:24:57,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:24:57,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679089263] [2024-10-23 22:24:57,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:24:57,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:24:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:24:57,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:24:57,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:24:57,111 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:24:57,170 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2024-10-23 22:24:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:24:57,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-23 22:24:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:24:57,179 INFO L225 Difference]: With dead ends: 50 [2024-10-23 22:24:57,180 INFO L226 Difference]: Without dead ends: 24 [2024-10-23 22:24:57,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:24:57,189 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:24:57,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:24:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-23 22:24:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-23 22:24:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 22:24:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-23 22:24:57,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-10-23 22:24:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:24:57,231 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-23 22:24:57,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-23 22:24:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-23 22:24:57,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:24:57,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:24:57,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 22:24:57,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:24:57,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:24:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1660176756, now seen corresponding path program 1 times [2024-10-23 22:24:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:24:57,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114736583] [2024-10-23 22:24:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:24:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:24:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:24:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:24:57,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:24:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114736583] [2024-10-23 22:24:57,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114736583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:24:57,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:24:57,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:24:57,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530598029] [2024-10-23 22:24:57,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:24:57,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:24:57,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:24:57,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:24:57,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:24:57,546 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:57,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:24:57,602 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-23 22:24:57,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:24:57,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-23 22:24:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:24:57,605 INFO L225 Difference]: With dead ends: 36 [2024-10-23 22:24:57,605 INFO L226 Difference]: Without dead ends: 28 [2024-10-23 22:24:57,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:24:57,607 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:24:57,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:24:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-23 22:24:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-23 22:24:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:24:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-23 22:24:57,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2024-10-23 22:24:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:24:57,616 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-23 22:24:57,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-23 22:24:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-23 22:24:57,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:24:57,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:24:57,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 22:24:57,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:24:57,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:24:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1141436138, now seen corresponding path program 1 times [2024-10-23 22:24:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:24:57,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480256540] [2024-10-23 22:24:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:24:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:24:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:57,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:24:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:24:57,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:24:57,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480256540] [2024-10-23 22:24:57,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480256540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:24:57,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:24:57,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:24:57,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271662858] [2024-10-23 22:24:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:24:57,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:24:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:24:57,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:24:57,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:24:57,778 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:24:57,841 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-23 22:24:57,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:24:57,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-23 22:24:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:24:57,843 INFO L225 Difference]: With dead ends: 40 [2024-10-23 22:24:57,843 INFO L226 Difference]: Without dead ends: 32 [2024-10-23 22:24:57,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:24:57,845 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 22:24:57,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:24:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-23 22:24:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-23 22:24:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:24:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-23 22:24:57,855 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2024-10-23 22:24:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:24:57,855 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-23 22:24:57,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-23 22:24:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-23 22:24:57,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:24:57,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:24:57,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 22:24:57,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:24:57,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:24:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash -731973192, now seen corresponding path program 1 times [2024-10-23 22:24:57,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:24:57,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441418521] [2024-10-23 22:24:57,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:24:57,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:24:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:57,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:24:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:24:58,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:24:58,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441418521] [2024-10-23 22:24:58,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441418521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:24:58,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:24:58,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:24:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214770197] [2024-10-23 22:24:58,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:24:58,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:24:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:24:58,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:24:58,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:24:58,033 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:24:58,076 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-23 22:24:58,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:24:58,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-23 22:24:58,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:24:58,078 INFO L225 Difference]: With dead ends: 40 [2024-10-23 22:24:58,078 INFO L226 Difference]: Without dead ends: 32 [2024-10-23 22:24:58,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:24:58,079 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:24:58,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:24:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-23 22:24:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-23 22:24:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:24:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-23 22:24:58,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 16 [2024-10-23 22:24:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:24:58,092 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-23 22:24:58,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-23 22:24:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-23 22:24:58,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:24:58,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:24:58,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 22:24:58,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:24:58,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:24:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash 436592986, now seen corresponding path program 1 times [2024-10-23 22:24:58,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:24:58,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926932719] [2024-10-23 22:24:58,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:24:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:24:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:24:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:24:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:24:58,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:24:58,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926932719] [2024-10-23 22:24:58,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926932719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:24:58,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:24:58,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:24:58,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366666155] [2024-10-23 22:24:58,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:24:58,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:24:58,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:24:58,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:24:58,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:24:58,232 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:24:58,275 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-23 22:24:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:24:58,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-23 22:24:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:24:58,278 INFO L225 Difference]: With dead ends: 40 [2024-10-23 22:24:58,278 INFO L226 Difference]: Without dead ends: 32 [2024-10-23 22:24:58,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:24:58,279 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:24:58,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:24:58,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-23 22:24:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-23 22:24:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:24:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-23 22:24:58,293 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2024-10-23 22:24:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:24:58,294 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-23 22:24:58,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:24:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-23 22:24:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-23 22:24:58,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:24:58,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:24:58,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 22:24:58,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:24:58,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:24:58,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1370861477, now seen corresponding path program 1 times [2024-10-23 22:24:58,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:24:58,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730479349] [2024-10-23 22:24:58,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:24:58,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:24:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:24:58,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 22:24:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:24:58,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-23 22:24:58,370 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 22:24:58,372 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 22:24:58,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 22:24:58,380 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-23 22:24:58,406 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 22:24:58,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:24:58 BoogieIcfgContainer [2024-10-23 22:24:58,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 22:24:58,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 22:24:58,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 22:24:58,416 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 22:24:58,417 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:24:56" (3/4) ... [2024-10-23 22:24:58,419 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-23 22:24:58,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 22:24:58,421 INFO L158 Benchmark]: Toolchain (without parser) took 2609.85ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 84.4MB in the beginning and 112.2MB in the end (delta: -27.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-23 22:24:58,423 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 136.3MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:24:58,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.70ms. Allocated memory is still 136.3MB. Free memory was 84.4MB in the beginning and 70.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 22:24:58,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.19ms. Allocated memory is still 136.3MB. Free memory was 70.5MB in the beginning and 69.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:24:58,424 INFO L158 Benchmark]: Boogie Preprocessor took 60.03ms. Allocated memory is still 136.3MB. Free memory was 69.0MB in the beginning and 67.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:24:58,424 INFO L158 Benchmark]: RCFGBuilder took 469.57ms. Allocated memory is still 136.3MB. Free memory was 66.7MB in the beginning and 101.7MB in the end (delta: -35.1MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-23 22:24:58,424 INFO L158 Benchmark]: TraceAbstraction took 1715.59ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 101.1MB in the beginning and 113.3MB in the end (delta: -12.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-10-23 22:24:58,425 INFO L158 Benchmark]: Witness Printer took 4.46ms. Allocated memory is still 182.5MB. Free memory was 113.3MB in the beginning and 112.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:24:58,428 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.18ms. Allocated memory is still 136.3MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.70ms. Allocated memory is still 136.3MB. Free memory was 84.4MB in the beginning and 70.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.19ms. Allocated memory is still 136.3MB. Free memory was 70.5MB in the beginning and 69.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.03ms. Allocated memory is still 136.3MB. Free memory was 69.0MB in the beginning and 67.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 469.57ms. Allocated memory is still 136.3MB. Free memory was 66.7MB in the beginning and 101.7MB in the end (delta: -35.1MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1715.59ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 101.1MB in the beginning and 113.3MB in the end (delta: -12.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * Witness Printer took 4.46ms. Allocated memory is still 182.5MB. Free memory was 113.3MB in the beginning and 112.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 76. 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)=4294967306] [L21] __uint32_t msw, lsw; VAL [\old(x)=4294967306, x=4294967306] [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)=4294967306, lsw=4294967297, msw=2146435073, x=4294967306] [L33-L34] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=2146435073, x=4294967306] [L36-L37] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=2146435073, x=4294967306] [L40-L41] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L44] return 0; VAL [\old(x)=4294967306, \result=0, x=4294967306] [L48] RET, EXPR __fpclassify_double(x) VAL [x=4294967306, y=0] [L48] COND TRUE __fpclassify_double(x) == 0 [L49] return y; VAL [\result=0, x=4294967306] [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=0] [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() VAL [res=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 474 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 148 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-23 22:24:58,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_1232b.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 e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 22:25:00,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:25:00,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-23 22:25:00,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:25:00,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:25:00,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:25:00,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:25:00,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:25:00,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:25:00,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:25:00,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:25:00,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:25:00,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:25:00,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:25:00,908 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:25:00,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:25:00,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:25:00,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:25:00,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:25:00,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:25:00,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:25:00,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:25:00,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:25:00,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-23 22:25:00,912 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-23 22:25:00,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:25:00,912 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-23 22:25:00,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:25:00,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:25:00,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:25:00,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:25:00,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:25:00,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:25:00,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:25:00,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:25:00,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:25:00,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:25:00,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:25:00,916 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-23 22:25:00,917 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-23 22:25:00,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:25:00,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:25:00,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:25:00,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:25:00,918 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-23 22:25:00,918 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 -> e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 [2024-10-23 22:25:01,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:25:01,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:25:01,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:25:01,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:25:01,281 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:25:01,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2024-10-23 22:25:02,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:25:03,056 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:25:03,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2024-10-23 22:25:03,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920d476e4/362130869ad24db3b753ee32b8f71ccd/FLAG2f4924a63 [2024-10-23 22:25:03,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920d476e4/362130869ad24db3b753ee32b8f71ccd [2024-10-23 22:25:03,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:25:03,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:25:03,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:25:03,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:25:03,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:25:03,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffc5dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03, skipping insertion in model container [2024-10-23 22:25:03,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:25:03,349 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_1232b.c[1958,1971] [2024-10-23 22:25:03,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:25:03,372 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 22:25:03,405 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_1232b.c[1958,1971] [2024-10-23 22:25:03,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:25:03,434 INFO L204 MainTranslator]: Completed translation [2024-10-23 22:25:03,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03 WrapperNode [2024-10-23 22:25:03,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 22:25:03,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 22:25:03,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 22:25:03,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 22:25:03,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,485 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-10-23 22:25:03,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 22:25:03,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 22:25:03,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 22:25:03,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 22:25:03,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,530 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-23 22:25:03,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,545 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 22:25:03,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 22:25:03,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 22:25:03,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 22:25:03,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (1/1) ... [2024-10-23 22:25:03,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:25:03,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 22:25:03,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 22:25:03,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 22:25:03,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 22:25:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-23 22:25:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-23 22:25:03,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-23 22:25:03,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-23 22:25:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-23 22:25:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-23 22:25:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 22:25:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-23 22:25:03,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-23 22:25:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-23 22:25:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-23 22:25:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-23 22:25:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 22:25:03,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 22:25:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 22:25:03,768 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 22:25:03,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 22:25:04,079 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-23 22:25:04,080 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 22:25:04,118 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 22:25:04,118 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-23 22:25:04,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:25:04 BoogieIcfgContainer [2024-10-23 22:25:04,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 22:25:04,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 22:25:04,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 22:25:04,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 22:25:04,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:25:03" (1/3) ... [2024-10-23 22:25:04,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c3cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:25:04, skipping insertion in model container [2024-10-23 22:25:04,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:25:03" (2/3) ... [2024-10-23 22:25:04,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461c3cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:25:04, skipping insertion in model container [2024-10-23 22:25:04,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:25:04" (3/3) ... [2024-10-23 22:25:04,126 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b.c [2024-10-23 22:25:04,141 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 22:25:04,141 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 22:25:04,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 22:25:04,200 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;@46afa834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 22:25:04,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 22:25:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 22:25:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-23 22:25:04,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:04,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:04,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:04,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1087397120, now seen corresponding path program 1 times [2024-10-23 22:25:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:04,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612346631] [2024-10-23 22:25:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:04,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:04,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:04,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:25:04,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-23 22:25:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:04,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-23 22:25:04,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:25:04,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:04,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:04,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612346631] [2024-10-23 22:25:04,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612346631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:04,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:04,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 22:25:04,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66625857] [2024-10-23 22:25:04,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:04,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 22:25:04,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:04,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 22:25:04,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 22:25:04,379 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:25:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:04,410 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2024-10-23 22:25:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 22:25:04,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-23 22:25:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:04,421 INFO L225 Difference]: With dead ends: 46 [2024-10-23 22:25:04,422 INFO L226 Difference]: Without dead ends: 22 [2024-10-23 22:25:04,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 22:25:04,431 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:25:04,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:25:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-23 22:25:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-23 22:25:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 22:25:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-23 22:25:04,463 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2024-10-23 22:25:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:04,464 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-23 22:25:04,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:25:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-23 22:25:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-23 22:25:04,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:04,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:04,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-23 22:25:04,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:04,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:04,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1335499105, now seen corresponding path program 1 times [2024-10-23 22:25:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:04,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713421612] [2024-10-23 22:25:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:04,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:04,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:04,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:25:04,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-23 22:25:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:04,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:25:04,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:25:04,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:04,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:04,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713421612] [2024-10-23 22:25:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713421612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:04,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:04,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:25:04,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782065764] [2024-10-23 22:25:04,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:04,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:25:04,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:04,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:25:04,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:25:04,828 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:25:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:04,880 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-10-23 22:25:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:25:04,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-23 22:25:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:04,882 INFO L225 Difference]: With dead ends: 33 [2024-10-23 22:25:04,882 INFO L226 Difference]: Without dead ends: 25 [2024-10-23 22:25:04,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:25:04,884 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:25:04,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:25:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-23 22:25:04,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-23 22:25:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-23 22:25:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-23 22:25:04,898 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2024-10-23 22:25:04,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:04,899 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-23 22:25:04,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:25:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-10-23 22:25:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-23 22:25:04,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:04,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:04,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-23 22:25:05,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:05,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:05,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash -710780355, now seen corresponding path program 1 times [2024-10-23 22:25:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:05,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302769396] [2024-10-23 22:25:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:05,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:05,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:05,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:25:05,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-23 22:25:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:05,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-23 22:25:05,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:25:05,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:05,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:05,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302769396] [2024-10-23 22:25:05,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302769396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:05,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:05,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 22:25:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341162535] [2024-10-23 22:25:05,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 22:25:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:05,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 22:25:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:25:05,433 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:25:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:05,794 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-10-23 22:25:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 22:25:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-23 22:25:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:05,796 INFO L225 Difference]: With dead ends: 50 [2024-10-23 22:25:05,796 INFO L226 Difference]: Without dead ends: 28 [2024-10-23 22:25:05,797 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-23 22:25:05,798 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:25:05,798 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.3s Time] [2024-10-23 22:25:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-23 22:25:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-23 22:25:05,809 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-23 22:25:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-23 22:25:05,812 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-10-23 22:25:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:05,813 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-23 22:25:05,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:25:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-23 22:25:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-23 22:25:05,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:05,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:05,820 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-23 22:25:06,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:06,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:06,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash -143061541, now seen corresponding path program 1 times [2024-10-23 22:25:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:06,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465101445] [2024-10-23 22:25:06,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:06,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:06,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:06,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:25:06,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-23 22:25:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:06,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:25:06,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:25:06,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:06,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465101445] [2024-10-23 22:25:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465101445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:06,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:06,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:25:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213206490] [2024-10-23 22:25:06,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:06,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:25:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:06,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:25:06,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:25:06,125 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-23 22:25:06,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:06,164 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-10-23 22:25:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:25:06,165 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-23 22:25:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:06,166 INFO L225 Difference]: With dead ends: 38 [2024-10-23 22:25:06,166 INFO L226 Difference]: Without dead ends: 30 [2024-10-23 22:25:06,166 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-23 22:25:06,167 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-23 22:25:06,168 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-23 22:25:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-23 22:25:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-23 22:25:06,174 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-23 22:25:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-23 22:25:06,175 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 15 [2024-10-23 22:25:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:06,175 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-23 22:25:06,176 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-23 22:25:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-23 22:25:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-23 22:25:06,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:06,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:06,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-23 22:25:06,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:06,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:06,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1342340743, now seen corresponding path program 1 times [2024-10-23 22:25:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:06,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99453106] [2024-10-23 22:25:06,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:06,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:06,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:06,386 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:25:06,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-23 22:25:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:06,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-23 22:25:06,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:25:06,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:06,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:06,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99453106] [2024-10-23 22:25:06,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99453106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:06,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:06,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 22:25:06,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700703203] [2024-10-23 22:25:06,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:06,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 22:25:06,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:06,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 22:25:06,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:25:06,643 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-23 22:25:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:06,914 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-10-23 22:25:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 22:25:06,916 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-23 22:25:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:06,917 INFO L225 Difference]: With dead ends: 50 [2024-10-23 22:25:06,917 INFO L226 Difference]: Without dead ends: 26 [2024-10-23 22:25:06,918 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-23 22:25:06,918 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-23 22:25:06,919 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-23 22:25:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-23 22:25:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-23 22:25:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 22:25:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-23 22:25:06,931 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2024-10-23 22:25:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:06,931 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-23 22:25:06,931 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-23 22:25:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-23 22:25:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-23 22:25:06,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:06,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:06,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-23 22:25:07,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:07,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:07,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1234767684, now seen corresponding path program 1 times [2024-10-23 22:25:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217325909] [2024-10-23 22:25:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:07,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:07,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:07,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:25:07,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-23 22:25:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:07,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:25:07,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:25:07,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:07,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:07,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217325909] [2024-10-23 22:25:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217325909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:07,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:07,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:25:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868178578] [2024-10-23 22:25:07,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:07,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:25:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:07,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:25:07,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:25:07,227 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:25:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:07,262 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-23 22:25:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:25:07,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-23 22:25:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:07,264 INFO L225 Difference]: With dead ends: 35 [2024-10-23 22:25:07,264 INFO L226 Difference]: Without dead ends: 27 [2024-10-23 22:25:07,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:25:07,265 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:25:07,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:25:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-23 22:25:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-23 22:25:07,270 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-23 22:25:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-23 22:25:07,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 21 [2024-10-23 22:25:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:07,271 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-23 22:25:07,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:25:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-23 22:25:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-23 22:25:07,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:07,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:07,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-23 22:25:07,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:07,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:07,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1232920642, now seen corresponding path program 1 times [2024-10-23 22:25:07,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:07,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340845651] [2024-10-23 22:25:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:07,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:07,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:07,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:25:07,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-23 22:25:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:07,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-23 22:25:07,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:25:07,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:07,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:07,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340845651] [2024-10-23 22:25:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340845651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:07,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:07,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:25:07,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606369094] [2024-10-23 22:25:07,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:07,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:25:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:07,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:25:07,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:25:07,618 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-23 22:25:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:07,665 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-10-23 22:25:07,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:25:07,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-23 22:25:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:07,666 INFO L225 Difference]: With dead ends: 32 [2024-10-23 22:25:07,666 INFO L226 Difference]: Without dead ends: 29 [2024-10-23 22:25:07,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:25:07,667 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:25:07,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:25:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-23 22:25:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-23 22:25:07,672 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-23 22:25:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-23 22:25:07,673 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 21 [2024-10-23 22:25:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:07,673 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-23 22:25:07,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:25:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-23 22:25:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-23 22:25:07,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:07,674 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:07,680 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-23 22:25:07,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:07,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:07,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash 527910856, now seen corresponding path program 1 times [2024-10-23 22:25:07,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:07,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856851541] [2024-10-23 22:25:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:07,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:07,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:07,880 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-23 22:25:07,881 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-23 22:25:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:07,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-23 22:25:07,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 22:25:08,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:08,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856851541] [2024-10-23 22:25:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856851541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:08,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:08,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 22:25:08,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114476774] [2024-10-23 22:25:08,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:08,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 22:25:08,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:08,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 22:25:08,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:25:08,121 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-23 22:25:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:08,344 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-23 22:25:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 22:25:08,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-23 22:25:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:08,345 INFO L225 Difference]: With dead ends: 42 [2024-10-23 22:25:08,345 INFO L226 Difference]: Without dead ends: 29 [2024-10-23 22:25:08,346 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-23 22:25:08,347 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.2s IncrementalHoareTripleChecker+Time [2024-10-23 22:25:08,347 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.2s Time] [2024-10-23 22:25:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-23 22:25:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-23 22:25:08,351 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-23 22:25:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-23 22:25:08,352 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-10-23 22:25:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:08,352 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-23 22:25:08,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:25:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-23 22:25:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-23 22:25:08,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:08,353 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-23 22:25:08,359 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-23 22:25:08,557 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-23 22:25:08,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:08,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2012644792, now seen corresponding path program 1 times [2024-10-23 22:25:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090536536] [2024-10-23 22:25:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:08,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:08,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:08,560 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-23 22:25:08,561 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-23 22:25:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:08,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:25:08,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:25:08,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:08,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090536536] [2024-10-23 22:25:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090536536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:08,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:08,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:25:08,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979799070] [2024-10-23 22:25:08,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:08,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:25:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:08,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:25:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:25:08,658 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-23 22:25:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:08,693 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-23 22:25:08,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:25:08,693 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-23 22:25:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:08,694 INFO L225 Difference]: With dead ends: 38 [2024-10-23 22:25:08,694 INFO L226 Difference]: Without dead ends: 30 [2024-10-23 22:25:08,695 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-23 22:25:08,695 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-23 22:25:08,695 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-23 22:25:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-23 22:25:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-23 22:25:08,701 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-23 22:25:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-23 22:25:08,703 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 23 [2024-10-23 22:25:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:08,703 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-23 22:25:08,703 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-23 22:25:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-23 22:25:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-23 22:25:08,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:08,704 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-23 22:25:08,709 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-23 22:25:08,905 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-23 22:25:08,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:08,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:08,906 INFO L85 PathProgramCache]: Analyzing trace with hash -823936700, now seen corresponding path program 1 times [2024-10-23 22:25:08,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:08,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326745936] [2024-10-23 22:25:08,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:08,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:25:08,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:08,908 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-23 22:25:08,909 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-23 22:25:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:25:08,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-23 22:25:08,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:25:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 22:25:09,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:25:09,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:25:09,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326745936] [2024-10-23 22:25:09,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326745936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:25:09,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:25:09,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 22:25:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127375941] [2024-10-23 22:25:09,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:25:09,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 22:25:09,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:25:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 22:25:09,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:25:09,111 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-23 22:25:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:25:09,272 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-23 22:25:09,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 22:25:09,273 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-23 22:25:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:25:09,274 INFO L225 Difference]: With dead ends: 35 [2024-10-23 22:25:09,274 INFO L226 Difference]: Without dead ends: 21 [2024-10-23 22:25:09,274 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-23 22:25:09,275 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-23 22:25:09,275 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-23 22:25:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-23 22:25:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-23 22:25:09,278 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-23 22:25:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-23 22:25:09,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 24 [2024-10-23 22:25:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:25:09,278 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-23 22:25:09,279 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-23 22:25:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-23 22:25:09,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-23 22:25:09,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:25:09,280 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:09,285 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 (11)] Forceful destruction successful, exit code 0 [2024-10-23 22:25:09,480 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-23 22:25:09,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:25:09,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:25:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 118740037, now seen corresponding path program 1 times [2024-10-23 22:25:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:25:09,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549162781] [2024-10-23 22:25:09,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:25:09,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-23 22:25:09,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:25:09,483 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-23 22:25:09,484 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-23 22:25:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:25:09,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 22:25:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:25:09,661 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-23 22:25:09,661 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 22:25:09,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 22:25:09,671 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-23 22:25:09,867 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-23 22:25:09,871 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:25:09,903 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 22:25:09,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:25:09 BoogieIcfgContainer [2024-10-23 22:25:09,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 22:25:09,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 22:25:09,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 22:25:09,909 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 22:25:09,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:25:04" (3/4) ... [2024-10-23 22:25:09,911 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-23 22:25:09,959 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 22:25:09,959 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 22:25:09,959 INFO L158 Benchmark]: Toolchain (without parser) took 6878.78ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 32.7MB in the beginning and 49.2MB in the end (delta: -16.5MB). Peak memory consumption was 123.7kB. Max. memory is 16.1GB. [2024-10-23 22:25:09,960 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 44.0MB. Free memory was 25.2MB in the beginning and 25.2MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:25:09,960 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.88ms. Allocated memory is still 62.9MB. Free memory was 32.6MB in the beginning and 36.7MB in the end (delta: -4.1MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-23 22:25:09,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.16ms. Allocated memory is still 62.9MB. Free memory was 36.7MB in the beginning and 35.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:25:09,960 INFO L158 Benchmark]: Boogie Preprocessor took 81.39ms. Allocated memory is still 62.9MB. Free memory was 35.1MB in the beginning and 32.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:25:09,960 INFO L158 Benchmark]: RCFGBuilder took 548.40ms. Allocated memory is still 62.9MB. Free memory was 32.5MB in the beginning and 35.2MB in the end (delta: -2.7MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-23 22:25:09,961 INFO L158 Benchmark]: TraceAbstraction took 5787.96ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 34.7MB in the beginning and 51.4MB in the end (delta: -16.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:25:09,961 INFO L158 Benchmark]: Witness Printer took 49.91ms. Allocated memory is still 79.7MB. Free memory was 51.4MB in the beginning and 49.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:25:09,962 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.30ms. Allocated memory is still 44.0MB. Free memory was 25.2MB in the beginning and 25.2MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.88ms. Allocated memory is still 62.9MB. Free memory was 32.6MB in the beginning and 36.7MB in the end (delta: -4.1MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.16ms. Allocated memory is still 62.9MB. Free memory was 36.7MB in the beginning and 35.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.39ms. Allocated memory is still 62.9MB. Free memory was 35.1MB in the beginning and 32.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 548.40ms. Allocated memory is still 62.9MB. Free memory was 32.5MB in the beginning and 35.2MB in the end (delta: -2.7MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5787.96ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 34.7MB in the beginning and 51.4MB in the end (delta: -16.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 49.91ms. Allocated memory is still 79.7MB. Free memory was 51.4MB in the beginning and 49.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 82]: a call to reach_error is reachable a call to reach_error is reachable We found a 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.0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.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 TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L48] RET, EXPR __fpclassify_double(x) VAL [x=0.0, y=0.0] [L48] COND FALSE !(__fpclassify_double(x) == 0) [L50] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.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 TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L50] RET, EXPR __fpclassify_double(y) VAL [x=0.0, y=0.0] [L50] COND FALSE !(__fpclassify_double(y) == 0) [L53] return x < y ? x : y; VAL [\result=0.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=0.0] [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] CALL, EXPR __signbit_double(res) [L57] __uint32_t msw; VAL [x=0.0] [L60] ieee_double_shape_type gh_u; [L61] gh_u.value = (x) [L62] EXPR gh_u.parts.msw [L62] (msw) = gh_u.parts.msw [L65] return (msw & 0x80000000) != 0; [L81] RET, EXPR __signbit_double(res) [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 628 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 411 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 217 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=7, InterpolantAutomatonStates: 49, 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 171 ConstructedInterpolants, 24 QuantifiedInterpolants, 740 SizeOfPredicates, 15 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 30/30 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 proved your program to be incorrect! [2024-10-23 22:25:09,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE