./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:21:26,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:21:26,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 05:21:26,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:21:26,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:21:26,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:21:26,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:21:26,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:21:26,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:21:26,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:21:26,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:21:26,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:21:26,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:21:26,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:21:26,295 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:21:26,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:21:26,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:21:26,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:21:26,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 05:21:26,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:21:26,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:21:26,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:21:26,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:21:26,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:21:26,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:21:26,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:21:26,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:21:26,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:21:26,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:21:26,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:21:26,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:21:26,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:21:26,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:21:26,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:21:26,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:21:26,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:21:26,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 05:21:26,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 05:21:26,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:21:26,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:21:26,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:21:26,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:21:26,306 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2024-11-16 05:21:26,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:21:26,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:21:26,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:21:26,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:21:26,528 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:21:26,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-11-16 05:21:27,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:21:28,109 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:21:28,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-11-16 05:21:28,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9c5fd19/5e644d8321014b22a8dbaab19691f20d/FLAG7823a8a28 [2024-11-16 05:21:28,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca9c5fd19/5e644d8321014b22a8dbaab19691f20d [2024-11-16 05:21:28,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:21:28,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:21:28,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:21:28,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:21:28,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:21:28,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d02822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28, skipping insertion in model container [2024-11-16 05:21:28,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:21:28,309 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2024-11-16 05:21:28,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2024-11-16 05:21:28,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:21:28,321 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 05:21:28,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2024-11-16 05:21:28,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2024-11-16 05:21:28,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:21:28,352 INFO L204 MainTranslator]: Completed translation [2024-11-16 05:21:28,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28 WrapperNode [2024-11-16 05:21:28,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 05:21:28,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 05:21:28,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 05:21:28,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 05:21:28,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,381 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-11-16 05:21:28,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 05:21:28,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 05:21:28,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 05:21:28,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 05:21:28,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,418 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-16 05:21:28,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 05:21:28,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 05:21:28,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 05:21:28,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 05:21:28,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (1/1) ... [2024-11-16 05:21:28,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:21:28,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 05:21:28,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 05:21:28,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 05:21:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 05:21:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 05:21:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 05:21:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 05:21:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-16 05:21:28,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-16 05:21:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-11-16 05:21:28,521 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-11-16 05:21:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 05:21:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 05:21:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 05:21:28,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 05:21:28,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 05:21:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 05:21:28,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 05:21:28,600 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 05:21:28,602 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 05:21:28,826 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-16 05:21:28,826 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 05:21:28,840 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 05:21:28,841 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 05:21:28,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:28 BoogieIcfgContainer [2024-11-16 05:21:28,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 05:21:28,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 05:21:28,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 05:21:28,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 05:21:28,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:21:28" (1/3) ... [2024-11-16 05:21:28,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a95e650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:21:28, skipping insertion in model container [2024-11-16 05:21:28,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:28" (2/3) ... [2024-11-16 05:21:28,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a95e650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:21:28, skipping insertion in model container [2024-11-16 05:21:28,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:28" (3/3) ... [2024-11-16 05:21:28,851 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2024-11-16 05:21:28,865 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 05:21:28,865 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 05:21:28,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 05:21:28,922 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;@2be2eca0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 05:21:28,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 05:21:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 44 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 05:21:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 05:21:28,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:28,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:28,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:28,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash 690831290, now seen corresponding path program 1 times [2024-11-16 05:21:28,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:28,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433193948] [2024-11-16 05:21:28,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:28,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 05:21:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 05:21:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 05:21:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:29,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433193948] [2024-11-16 05:21:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433193948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:29,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002610610] [2024-11-16 05:21:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:29,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:29,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:29,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:29,285 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 44 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 05:21:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:29,419 INFO L93 Difference]: Finished difference Result 99 states and 141 transitions. [2024-11-16 05:21:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-16 05:21:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:29,428 INFO L225 Difference]: With dead ends: 99 [2024-11-16 05:21:29,428 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 05:21:29,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11-16 05:21:29,446 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:29,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 226 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:21:29,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 05:21:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 05:21:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 05:21:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-11-16 05:21:29,488 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 28 [2024-11-16 05:21:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:29,489 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-11-16 05:21:29,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 05:21:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-11-16 05:21:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 05:21:29,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:29,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:29,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 05:21:29,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:29,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash 305672663, now seen corresponding path program 1 times [2024-11-16 05:21:29,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939340160] [2024-11-16 05:21:29,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:29,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 05:21:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 05:21:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 05:21:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 05:21:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:29,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939340160] [2024-11-16 05:21:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939340160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:29,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869420003] [2024-11-16 05:21:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:29,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:29,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:29,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:29,686 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:29,756 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2024-11-16 05:21:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-16 05:21:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:29,759 INFO L225 Difference]: With dead ends: 77 [2024-11-16 05:21:29,759 INFO L226 Difference]: Without dead ends: 57 [2024-11-16 05:21:29,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-16 05:21:29,760 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:29,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 212 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:21:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-16 05:21:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-16 05:21:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-16 05:21:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-16 05:21:29,767 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 34 [2024-11-16 05:21:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:29,767 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-16 05:21:29,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-16 05:21:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 05:21:29,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:29,769 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:29,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 05:21:29,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:29,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1370953075, now seen corresponding path program 1 times [2024-11-16 05:21:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:29,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121913423] [2024-11-16 05:21:29,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 05:21:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 05:21:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 05:21:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 05:21:29,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:29,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121913423] [2024-11-16 05:21:29,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121913423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:29,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:29,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456276787] [2024-11-16 05:21:29,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:29,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:29,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:29,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:29,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:29,870 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:29,933 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-11-16 05:21:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-16 05:21:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:29,935 INFO L225 Difference]: With dead ends: 81 [2024-11-16 05:21:29,935 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 05:21:29,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-16 05:21:29,937 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:29,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:21:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 05:21:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-16 05:21:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-16 05:21:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-16 05:21:29,950 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 35 [2024-11-16 05:21:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:29,951 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-16 05:21:29,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-16 05:21:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 05:21:29,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:29,952 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:29,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 05:21:29,952 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:29,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash 809212532, now seen corresponding path program 1 times [2024-11-16 05:21:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:29,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970716067] [2024-11-16 05:21:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 05:21:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 05:21:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 05:21:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 05:21:30,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:30,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970716067] [2024-11-16 05:21:30,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970716067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:30,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:30,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209476068] [2024-11-16 05:21:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:30,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:30,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:30,101 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:30,165 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-11-16 05:21:30,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:30,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-16 05:21:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:30,166 INFO L225 Difference]: With dead ends: 81 [2024-11-16 05:21:30,166 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 05:21:30,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-16 05:21:30,169 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:30,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:21:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 05:21:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-16 05:21:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-16 05:21:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-16 05:21:30,182 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 36 [2024-11-16 05:21:30,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:30,182 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-16 05:21:30,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:30,182 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-16 05:21:30,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 05:21:30,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:30,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:30,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 05:21:30,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:30,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1349429936, now seen corresponding path program 1 times [2024-11-16 05:21:30,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:30,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461068727] [2024-11-16 05:21:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 05:21:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 05:21:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 05:21:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 05:21:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:30,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461068727] [2024-11-16 05:21:30,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461068727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:30,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:30,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:21:30,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990406322] [2024-11-16 05:21:30,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:30,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:21:30,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:30,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:21:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:21:30,284 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:30,372 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-11-16 05:21:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:21:30,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-11-16 05:21:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:30,373 INFO L225 Difference]: With dead ends: 81 [2024-11-16 05:21:30,373 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 05:21:30,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11-16 05:21:30,374 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:30,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:21:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 05:21:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-16 05:21:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-16 05:21:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2024-11-16 05:21:30,391 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 37 [2024-11-16 05:21:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:30,391 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2024-11-16 05:21:30,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2024-11-16 05:21:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 05:21:30,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:30,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:30,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 05:21:30,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:30,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash 843871311, now seen corresponding path program 1 times [2024-11-16 05:21:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519163486] [2024-11-16 05:21:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 05:21:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 05:21:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 05:21:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 05:21:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 05:21:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:21:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519163486] [2024-11-16 05:21:30,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519163486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:30,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:30,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196056915] [2024-11-16 05:21:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:30,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:21:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:30,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:30,485 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 05:21:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:30,548 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2024-11-16 05:21:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-16 05:21:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:30,549 INFO L225 Difference]: With dead ends: 60 [2024-11-16 05:21:30,549 INFO L226 Difference]: Without dead ends: 58 [2024-11-16 05:21:30,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-11-16 05:21:30,553 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:30,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 161 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:21:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-16 05:21:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-16 05:21:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-16 05:21:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-16 05:21:30,562 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 37 [2024-11-16 05:21:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:30,562 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-16 05:21:30,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 05:21:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-16 05:21:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 05:21:30,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:30,567 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:30,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 05:21:30,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:30,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:30,568 INFO L85 PathProgramCache]: Analyzing trace with hash -472886071, now seen corresponding path program 1 times [2024-11-16 05:21:30,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:21:30,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269606902] [2024-11-16 05:21:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:21:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:21:30,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 05:21:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:21:30,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 05:21:30,641 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 05:21:30,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-16 05:21:30,643 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-16 05:21:30,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 05:21:30,649 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:30,682 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 05:21:30,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:21:30 BoogieIcfgContainer [2024-11-16 05:21:30,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 05:21:30,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 05:21:30,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 05:21:30,690 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 05:21:30,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:28" (3/4) ... [2024-11-16 05:21:30,695 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 05:21:30,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 05:21:30,696 INFO L158 Benchmark]: Toolchain (without parser) took 2568.14ms. Allocated memory was 140.5MB in the beginning and 203.4MB in the end (delta: 62.9MB). Free memory was 72.0MB in the beginning and 140.5MB in the end (delta: -68.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:21:30,697 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 140.5MB. Free memory was 106.8MB in the beginning and 106.6MB in the end (delta: 149.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:21:30,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.27ms. Allocated memory was 140.5MB in the beginning and 203.4MB in the end (delta: 62.9MB). Free memory was 71.7MB in the beginning and 168.2MB in the end (delta: -96.5MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-16 05:21:30,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.48ms. Allocated memory is still 203.4MB. Free memory was 168.2MB in the beginning and 166.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:21:30,697 INFO L158 Benchmark]: Boogie Preprocessor took 56.51ms. Allocated memory is still 203.4MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:21:30,697 INFO L158 Benchmark]: IcfgBuilder took 403.25ms. Allocated memory is still 203.4MB. Free memory was 164.0MB in the beginning and 147.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 05:21:30,697 INFO L158 Benchmark]: TraceAbstraction took 1845.49ms. Allocated memory is still 203.4MB. Free memory was 146.2MB in the beginning and 140.5MB in the end (delta: 5.7MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2024-11-16 05:21:30,697 INFO L158 Benchmark]: Witness Printer took 6.41ms. Allocated memory is still 203.4MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:21:30,698 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 140.5MB. Free memory was 106.8MB in the beginning and 106.6MB in the end (delta: 149.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.27ms. Allocated memory was 140.5MB in the beginning and 203.4MB in the end (delta: 62.9MB). Free memory was 71.7MB in the beginning and 168.2MB in the end (delta: -96.5MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.48ms. Allocated memory is still 203.4MB. Free memory was 168.2MB in the beginning and 166.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.51ms. Allocated memory is still 203.4MB. Free memory was 166.1MB in the beginning and 164.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 403.25ms. Allocated memory is still 203.4MB. Free memory was 164.0MB in the beginning and 147.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1845.49ms. Allocated memory is still 203.4MB. Free memory was 146.2MB in the beginning and 140.5MB in the end (delta: 5.7MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 6.41ms. Allocated memory is still 203.4MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 76]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L69] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578699] [L57] return x != x; VAL [\old(x)=4286578699, \result=1] [L69] RET, EXPR isnan_float(x) VAL [x=4286578699] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699] [L69] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578698] [L57] return x != x; VAL [\old(x)=4286578698, \result=0] [L69] RET, EXPR isnan_float(y) VAL [x=4286578699, y=4286578698] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699, y=4286578698] [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [x=4286578699, y=4286578698] [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L72] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578699] [L23] __uint32_t w; VAL [\old(x)=4286578699, x=4286578699] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L29] COND FALSE !(0) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578699, w=4286578689, x=4286578699] [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; VAL [\old(x)=4286578699, \result=0, x=4286578699] [L46] RET, EXPR __fpclassify_float(x) VAL [x=4286578699, y=4286578698] [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; VAL [\result=4286578698, x=4286578699] [L72] RET, EXPR fmax_float(x, y) [L72] float res = fmax_float(x, y); [L75] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578699] [L57] return x != x; VAL [\old(x)=4286578699, \result=1] [L75] RET, EXPR isnan_float(x) VAL [x=4286578699, y=4286578698] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699, y=4286578698] [L75] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578698] [L57] return x != x; VAL [\old(x)=4286578698, \result=0] [L75] RET, EXPR isnan_float(y) VAL [x=4286578699, y=4286578698] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578699, y=4286578698] [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L76] reach_error() VAL [x=4286578699, y=4286578698] - 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: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 1283 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 878 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 405 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, InterpolantAutomatonStates: 29, 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, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 05:21:30,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1251.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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:21:33,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:21:33,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 05:21:33,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:21:33,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:21:33,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:21:33,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:21:33,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:21:33,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:21:33,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:21:33,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:21:33,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:21:33,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:21:33,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:21:33,116 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:21:33,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:21:33,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:21:33,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:21:33,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:21:33,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:21:33,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:21:33,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:21:33,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:21:33,122 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 05:21:33,123 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 05:21:33,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:21:33,123 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 05:21:33,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:21:33,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:21:33,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:21:33,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:21:33,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:21:33,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:21:33,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:21:33,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:21:33,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:21:33,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:21:33,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:21:33,125 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 05:21:33,125 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 05:21:33,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:21:33,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:21:33,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:21:33,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:21:33,127 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2024-11-16 05:21:33,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:21:33,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:21:33,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:21:33,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:21:33,403 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:21:33,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-11-16 05:21:35,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:21:35,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:21:35,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-11-16 05:21:35,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a6bf082/e889e428dd734548a53818ece80d50da/FLAG2a4002fe1 [2024-11-16 05:21:35,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08a6bf082/e889e428dd734548a53818ece80d50da [2024-11-16 05:21:35,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:21:35,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:21:35,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:21:35,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:21:35,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:21:35,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5293e27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35, skipping insertion in model container [2024-11-16 05:21:35,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:21:35,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2024-11-16 05:21:35,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2024-11-16 05:21:35,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:21:35,438 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 05:21:35,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2024-11-16 05:21:35,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2024-11-16 05:21:35,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:21:35,486 INFO L204 MainTranslator]: Completed translation [2024-11-16 05:21:35,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35 WrapperNode [2024-11-16 05:21:35,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 05:21:35,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 05:21:35,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 05:21:35,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 05:21:35,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,510 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,531 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-11-16 05:21:35,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 05:21:35,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 05:21:35,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 05:21:35,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 05:21:35,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,564 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-16 05:21:35,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,578 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 05:21:35,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 05:21:35,589 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 05:21:35,590 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 05:21:35,591 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (1/1) ... [2024-11-16 05:21:35,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:21:35,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 05:21:35,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 05:21:35,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 05:21:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 05:21:35,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 05:21:35,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 05:21:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 05:21:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-16 05:21:35,675 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-16 05:21:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-11-16 05:21:35,675 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-11-16 05:21:35,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 05:21:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 05:21:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 05:21:35,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 05:21:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 05:21:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 05:21:35,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 05:21:35,787 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 05:21:35,789 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 05:21:35,986 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-16 05:21:35,988 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 05:21:36,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 05:21:36,002 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 05:21:36,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:36 BoogieIcfgContainer [2024-11-16 05:21:36,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 05:21:36,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 05:21:36,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 05:21:36,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 05:21:36,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:21:35" (1/3) ... [2024-11-16 05:21:36,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af8c093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:21:36, skipping insertion in model container [2024-11-16 05:21:36,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:21:35" (2/3) ... [2024-11-16 05:21:36,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af8c093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:21:36, skipping insertion in model container [2024-11-16 05:21:36,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:21:36" (3/3) ... [2024-11-16 05:21:36,012 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2024-11-16 05:21:36,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 05:21:36,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 05:21:36,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 05:21:36,078 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;@599cb4e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 05:21:36,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 05:21:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 40 states have (on average 1.45) internal successors, (58), 42 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 05:21:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 05:21:36,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:36,089 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:36,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:36,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1438216552, now seen corresponding path program 1 times [2024-11-16 05:21:36,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:36,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961539437] [2024-11-16 05:21:36,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:36,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:36,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:36,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:36,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 05:21:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:36,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 05:21:36,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:21:36,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:36,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:36,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961539437] [2024-11-16 05:21:36,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961539437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:36,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:36,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 05:21:36,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390646699] [2024-11-16 05:21:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:36,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 05:21:36,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:36,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 05:21:36,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 05:21:36,255 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.45) internal successors, (58), 42 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 05:21:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:36,273 INFO L93 Difference]: Finished difference Result 91 states and 130 transitions. [2024-11-16 05:21:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 05:21:36,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-11-16 05:21:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:36,285 INFO L225 Difference]: With dead ends: 91 [2024-11-16 05:21:36,285 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 05:21:36,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 05:21:36,290 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:36,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 05:21:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-16 05:21:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 05:21:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-11-16 05:21:36,321 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 27 [2024-11-16 05:21:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:36,323 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-11-16 05:21:36,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 05:21:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-11-16 05:21:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 05:21:36,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:36,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:36,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 05:21:36,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:36,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:36,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1819386559, now seen corresponding path program 1 times [2024-11-16 05:21:36,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:36,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273457773] [2024-11-16 05:21:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:36,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:36,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:36,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:36,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 05:21:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:36,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:36,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:21:36,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:36,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:36,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273457773] [2024-11-16 05:21:36,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273457773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:36,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:36,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:36,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830276071] [2024-11-16 05:21:36,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:36,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:36,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:36,652 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 05:21:36,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:36,695 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2024-11-16 05:21:36,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:36,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-16 05:21:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:36,698 INFO L225 Difference]: With dead ends: 85 [2024-11-16 05:21:36,698 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 05:21:36,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-11-16 05:21:36,700 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 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-11-16 05:21:36,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 05:21:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-16 05:21:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-16 05:21:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-11-16 05:21:36,718 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 28 [2024-11-16 05:21:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:36,719 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-11-16 05:21:36,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 05:21:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-11-16 05:21:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 05:21:36,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:36,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:36,729 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-11-16 05:21:36,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:36,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:36,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:36,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1202900443, now seen corresponding path program 1 times [2024-11-16 05:21:36,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:36,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349839450] [2024-11-16 05:21:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:36,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:36,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:36,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:36,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 05:21:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:36,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:36,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 05:21:37,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:37,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349839450] [2024-11-16 05:21:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349839450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:37,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:37,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235925655] [2024-11-16 05:21:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:37,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:37,046 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:37,076 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2024-11-16 05:21:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:37,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-16 05:21:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:37,079 INFO L225 Difference]: With dead ends: 74 [2024-11-16 05:21:37,079 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 05:21:37,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-11-16 05:21:37,080 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:37,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 05:21:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-16 05:21:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-16 05:21:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-16 05:21:37,087 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 33 [2024-11-16 05:21:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:37,087 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-16 05:21:37,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-16 05:21:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 05:21:37,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:37,089 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:37,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 05:21:37,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:37,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:37,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash 170569089, now seen corresponding path program 1 times [2024-11-16 05:21:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:37,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689229484] [2024-11-16 05:21:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:37,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:37,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:37,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 05:21:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:37,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:37,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 05:21:37,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:37,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:37,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689229484] [2024-11-16 05:21:37,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689229484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:37,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:37,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654955995] [2024-11-16 05:21:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:37,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:37,373 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:37,396 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-16 05:21:37,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:37,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-11-16 05:21:37,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:37,398 INFO L225 Difference]: With dead ends: 77 [2024-11-16 05:21:37,398 INFO L226 Difference]: Without dead ends: 57 [2024-11-16 05:21:37,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-11-16 05:21:37,399 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:37,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-16 05:21:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-16 05:21:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-16 05:21:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-16 05:21:37,424 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 34 [2024-11-16 05:21:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:37,424 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-16 05:21:37,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-16 05:21:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 05:21:37,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:37,428 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:37,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 05:21:37,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:37,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:37,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1049217570, now seen corresponding path program 1 times [2024-11-16 05:21:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:37,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460881243] [2024-11-16 05:21:37,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:37,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:37,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:37,634 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-11-16 05:21:37,635 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-11-16 05:21:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:37,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:37,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 05:21:37,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:37,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460881243] [2024-11-16 05:21:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460881243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:37,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:37,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:37,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880313801] [2024-11-16 05:21:37,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:37,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:37,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:37,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:37,706 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:37,725 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-16 05:21:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:37,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-16 05:21:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:37,728 INFO L225 Difference]: With dead ends: 77 [2024-11-16 05:21:37,729 INFO L226 Difference]: Without dead ends: 57 [2024-11-16 05:21:37,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-11-16 05:21:37,730 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:37,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-16 05:21:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-16 05:21:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-16 05:21:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-16 05:21:37,741 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 35 [2024-11-16 05:21:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:37,741 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-16 05:21:37,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:37,742 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-16 05:21:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 05:21:37,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:37,745 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:37,749 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-11-16 05:21:37,948 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-11-16 05:21:37,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:37,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 509815908, now seen corresponding path program 1 times [2024-11-16 05:21:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771921540] [2024-11-16 05:21:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:37,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:37,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:37,953 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-11-16 05:21:37,954 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-11-16 05:21:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:38,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:38,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 05:21:38,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:38,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:38,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771921540] [2024-11-16 05:21:38,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771921540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:38,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:38,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:38,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092302891] [2024-11-16 05:21:38,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:38,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:38,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:38,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:38,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:38,044 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:38,074 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-11-16 05:21:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:38,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-16 05:21:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:38,075 INFO L225 Difference]: With dead ends: 77 [2024-11-16 05:21:38,075 INFO L226 Difference]: Without dead ends: 57 [2024-11-16 05:21:38,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-11-16 05:21:38,077 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:38,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-16 05:21:38,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-16 05:21:38,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-11-16 05:21:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-16 05:21:38,088 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 36 [2024-11-16 05:21:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:38,088 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-16 05:21:38,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:21:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-16 05:21:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 05:21:38,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:38,089 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:38,094 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-11-16 05:21:38,289 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-11-16 05:21:38,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:38,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash 216412901, now seen corresponding path program 1 times [2024-11-16 05:21:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:38,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438469938] [2024-11-16 05:21:38,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:38,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:38,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:38,295 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-11-16 05:21:38,296 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-11-16 05:21:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:38,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 05:21:38,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 05:21:38,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:21:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 05:21:39,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:39,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438469938] [2024-11-16 05:21:39,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438469938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 05:21:39,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:21:39,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-16 05:21:39,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029354556] [2024-11-16 05:21:39,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:21:39,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 05:21:39,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:39,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 05:21:39,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-16 05:21:39,339 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:39,659 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2024-11-16 05:21:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 05:21:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-11-16 05:21:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:39,660 INFO L225 Difference]: With dead ends: 96 [2024-11-16 05:21:39,660 INFO L226 Difference]: Without dead ends: 82 [2024-11-16 05:21:39,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-16 05:21:39,661 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 59 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:39,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 547 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 05:21:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-16 05:21:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2024-11-16 05:21:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-16 05:21:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2024-11-16 05:21:39,671 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 36 [2024-11-16 05:21:39,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:39,671 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2024-11-16 05:21:39,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2024-11-16 05:21:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 05:21:39,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:39,672 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:39,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-16 05:21:39,872 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-11-16 05:21:39,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:39,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash -31364564, now seen corresponding path program 1 times [2024-11-16 05:21:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:39,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109863861] [2024-11-16 05:21:39,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:39,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:39,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:39,877 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-11-16 05:21:39,878 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-11-16 05:21:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:39,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 05:21:39,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 05:21:40,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:40,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109863861] [2024-11-16 05:21:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109863861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:40,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:40,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 05:21:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680805684] [2024-11-16 05:21:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:40,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 05:21:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 05:21:40,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 05:21:40,064 INFO L87 Difference]: Start difference. First operand 70 states and 99 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 05:21:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:40,287 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2024-11-16 05:21:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 05:21:40,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-11-16 05:21:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:40,289 INFO L225 Difference]: With dead ends: 119 [2024-11-16 05:21:40,289 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 05:21:40,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-16 05:21:40,290 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:40,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 482 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 05:21:40,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 05:21:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 70. [2024-11-16 05:21:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-16 05:21:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2024-11-16 05:21:40,309 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 38 [2024-11-16 05:21:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:40,309 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2024-11-16 05:21:40,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 05:21:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2024-11-16 05:21:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 05:21:40,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:40,310 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:40,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-16 05:21:40,521 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-11-16 05:21:40,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1882790733, now seen corresponding path program 1 times [2024-11-16 05:21:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:40,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542590358] [2024-11-16 05:21:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:40,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:40,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:40,527 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-11-16 05:21:40,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-16 05:21:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:40,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 05:21:40,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 05:21:40,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:21:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 05:21:41,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:41,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542590358] [2024-11-16 05:21:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542590358] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 05:21:41,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:21:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-16 05:21:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892041247] [2024-11-16 05:21:41,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:21:41,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 05:21:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 05:21:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-16 05:21:41,215 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-16 05:21:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:41,687 INFO L93 Difference]: Finished difference Result 108 states and 152 transitions. [2024-11-16 05:21:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 05:21:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2024-11-16 05:21:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:41,689 INFO L225 Difference]: With dead ends: 108 [2024-11-16 05:21:41,692 INFO L226 Difference]: Without dead ends: 106 [2024-11-16 05:21:41,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-16 05:21:41,693 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 71 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:41,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 349 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 05:21:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-16 05:21:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2024-11-16 05:21:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-16 05:21:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-16 05:21:41,714 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 41 [2024-11-16 05:21:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:41,714 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-16 05:21:41,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-16 05:21:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-16 05:21:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 05:21:41,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:41,719 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:41,723 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 (10)] Ended with exit code 0 [2024-11-16 05:21:41,919 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-11-16 05:21:41,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:41,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1558753407, now seen corresponding path program 1 times [2024-11-16 05:21:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:41,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488262504] [2024-11-16 05:21:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:41,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:41,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:41,923 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-11-16 05:21:41,924 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-11-16 05:21:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:41,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 05:21:41,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 05:21:42,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:42,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:42,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488262504] [2024-11-16 05:21:42,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488262504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:42,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:42,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 05:21:42,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604401847] [2024-11-16 05:21:42,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:42,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 05:21:42,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:42,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 05:21:42,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:21:42,008 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-16 05:21:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:42,026 INFO L93 Difference]: Finished difference Result 83 states and 116 transitions. [2024-11-16 05:21:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 05:21:42,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2024-11-16 05:21:42,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:42,027 INFO L225 Difference]: With dead ends: 83 [2024-11-16 05:21:42,027 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 05:21:42,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-11-16 05:21:42,028 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:42,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 05:21:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-16 05:21:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2024-11-16 05:21:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-11-16 05:21:42,039 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 43 [2024-11-16 05:21:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:42,040 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-11-16 05:21:42,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-16 05:21:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-11-16 05:21:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 05:21:42,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:42,040 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:42,045 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-11-16 05:21:42,241 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-11-16 05:21:42,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:42,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:42,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1304817685, now seen corresponding path program 1 times [2024-11-16 05:21:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666202955] [2024-11-16 05:21:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:42,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:42,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:42,245 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-11-16 05:21:42,245 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-11-16 05:21:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:42,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:42,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 05:21:42,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:42,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:42,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666202955] [2024-11-16 05:21:42,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666202955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:42,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:42,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065159455] [2024-11-16 05:21:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:42,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:42,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:42,309 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:42,324 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2024-11-16 05:21:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:42,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-11-16 05:21:42,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:42,325 INFO L225 Difference]: With dead ends: 109 [2024-11-16 05:21:42,325 INFO L226 Difference]: Without dead ends: 84 [2024-11-16 05:21:42,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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-11-16 05:21:42,326 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:42,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-16 05:21:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-16 05:21:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.25) internal successors, (75), 59 states have internal predecessors, (75), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2024-11-16 05:21:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2024-11-16 05:21:42,331 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 46 [2024-11-16 05:21:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:42,331 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2024-11-16 05:21:42,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-11-16 05:21:42,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 05:21:42,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:42,332 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:42,342 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-11-16 05:21:42,533 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-11-16 05:21:42,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:42,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1710285933, now seen corresponding path program 1 times [2024-11-16 05:21:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:42,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83800678] [2024-11-16 05:21:42,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:42,536 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:42,537 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 (13)] Waiting until timeout for monitored process [2024-11-16 05:21:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:42,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 05:21:42,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 05:21:42,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:21:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 05:21:44,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:44,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83800678] [2024-11-16 05:21:44,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83800678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 05:21:44,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:21:44,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-16 05:21:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875063788] [2024-11-16 05:21:44,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:21:44,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-16 05:21:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-16 05:21:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-11-16 05:21:44,293 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-16 05:21:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:45,461 INFO L93 Difference]: Finished difference Result 147 states and 202 transitions. [2024-11-16 05:21:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 05:21:45,462 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Word has length 46 [2024-11-16 05:21:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:45,463 INFO L225 Difference]: With dead ends: 147 [2024-11-16 05:21:45,463 INFO L226 Difference]: Without dead ends: 110 [2024-11-16 05:21:45,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2024-11-16 05:21:45,464 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 54 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:45,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 858 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 05:21:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-16 05:21:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2024-11-16 05:21:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.25) internal successors, (75), 59 states have internal predecessors, (75), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (26), 22 states have call predecessors, (26), 18 states have call successors, (26) [2024-11-16 05:21:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-11-16 05:21:45,478 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 46 [2024-11-16 05:21:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:45,479 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-11-16 05:21:45,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-16 05:21:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-16 05:21:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 05:21:45,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:45,481 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:45,486 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 (13)] Ended with exit code 0 [2024-11-16 05:21:45,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:45,685 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:45,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash -326917015, now seen corresponding path program 1 times [2024-11-16 05:21:45,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:45,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821036308] [2024-11-16 05:21:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:45,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:45,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:45,692 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:45,693 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 (14)] Waiting until timeout for monitored process [2024-11-16 05:21:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:45,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:45,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 05:21:45,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:45,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:45,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821036308] [2024-11-16 05:21:45,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821036308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:45,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:45,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:45,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080850717] [2024-11-16 05:21:45,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:45,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:45,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:45,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:45,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:45,804 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:45,834 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2024-11-16 05:21:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:45,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-11-16 05:21:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:45,835 INFO L225 Difference]: With dead ends: 113 [2024-11-16 05:21:45,835 INFO L226 Difference]: Without dead ends: 88 [2024-11-16 05:21:45,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-11-16 05:21:45,835 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:45,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:45,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-16 05:21:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-16 05:21:45,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 61 states have internal predecessors, (77), 18 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (31), 23 states have call predecessors, (31), 18 states have call successors, (31) [2024-11-16 05:21:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2024-11-16 05:21:45,844 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 48 [2024-11-16 05:21:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:45,844 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2024-11-16 05:21:45,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2024-11-16 05:21:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 05:21:45,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:45,845 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:45,853 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 (14)] Ended with exit code 0 [2024-11-16 05:21:46,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:46,049 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:46,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1606780693, now seen corresponding path program 1 times [2024-11-16 05:21:46,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:46,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926102216] [2024-11-16 05:21:46,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:46,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:46,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:46,053 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:46,054 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 (15)] Waiting until timeout for monitored process [2024-11-16 05:21:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:46,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 05:21:46,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 05:21:46,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:21:47,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926102216] [2024-11-16 05:21:47,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926102216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 05:21:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [671595489] [2024-11-16 05:21:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:47,444 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 05:21:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 05:21:47,448 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 05:21:47,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-16 05:21:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:47,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 05:21:47,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 05:21:47,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:21:48,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [671595489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 05:21:48,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:21:48,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2024-11-16 05:21:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288438452] [2024-11-16 05:21:48,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:21:48,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 05:21:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 05:21:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-11-16 05:21:48,160 INFO L87 Difference]: Start difference. First operand 87 states and 126 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-16 05:21:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:48,728 INFO L93 Difference]: Finished difference Result 139 states and 200 transitions. [2024-11-16 05:21:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 05:21:48,729 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2024-11-16 05:21:48,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:48,732 INFO L225 Difference]: With dead ends: 139 [2024-11-16 05:21:48,732 INFO L226 Difference]: Without dead ends: 137 [2024-11-16 05:21:48,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-16 05:21:48,732 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:48,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 595 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 05:21:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-16 05:21:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 90. [2024-11-16 05:21:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.25) internal successors, (80), 62 states have internal predecessors, (80), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (35), 25 states have call predecessors, (35), 19 states have call successors, (35) [2024-11-16 05:21:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-16 05:21:48,747 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 48 [2024-11-16 05:21:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:48,747 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-16 05:21:48,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-16 05:21:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-16 05:21:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 05:21:48,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:48,748 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:48,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-16 05:21:48,952 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 (15)] Forceful destruction successful, exit code 0 [2024-11-16 05:21:49,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:49,149 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:49,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1755458174, now seen corresponding path program 1 times [2024-11-16 05:21:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:49,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281483064] [2024-11-16 05:21:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:49,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:49,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:49,155 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:49,158 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 (17)] Waiting until timeout for monitored process [2024-11-16 05:21:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:49,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 05:21:49,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-16 05:21:49,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:21:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 05:21:49,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:49,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281483064] [2024-11-16 05:21:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281483064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 05:21:49,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:21:49,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-16 05:21:49,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816544640] [2024-11-16 05:21:49,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:21:49,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 05:21:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:49,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 05:21:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-16 05:21:49,701 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 05:21:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:49,912 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2024-11-16 05:21:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 05:21:49,913 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2024-11-16 05:21:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:49,914 INFO L225 Difference]: With dead ends: 110 [2024-11-16 05:21:49,915 INFO L226 Difference]: Without dead ends: 89 [2024-11-16 05:21:49,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-16 05:21:49,917 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:49,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 458 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 05:21:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-16 05:21:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-16 05:21:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 18 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (31), 22 states have call predecessors, (31), 18 states have call successors, (31) [2024-11-16 05:21:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-16 05:21:49,930 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 48 [2024-11-16 05:21:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:49,930 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-16 05:21:49,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 05:21:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-16 05:21:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 05:21:49,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:49,932 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:49,936 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 (17)] Ended with exit code 0 [2024-11-16 05:21:50,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:50,133 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:50,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash 21703154, now seen corresponding path program 1 times [2024-11-16 05:21:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:50,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593490415] [2024-11-16 05:21:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:50,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:50,143 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:50,144 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 (18)] Waiting until timeout for monitored process [2024-11-16 05:21:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:50,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 05:21:50,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 05:21:50,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:21:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 05:21:50,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593490415] [2024-11-16 05:21:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593490415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 05:21:50,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:21:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2024-11-16 05:21:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060746675] [2024-11-16 05:21:50,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:21:50,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 05:21:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 05:21:50,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-16 05:21:50,557 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 05:21:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:50,772 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2024-11-16 05:21:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 05:21:50,772 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 48 [2024-11-16 05:21:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:50,773 INFO L225 Difference]: With dead ends: 117 [2024-11-16 05:21:50,773 INFO L226 Difference]: Without dead ends: 75 [2024-11-16 05:21:50,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-16 05:21:50,774 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 41 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:50,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 512 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 05:21:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-16 05:21:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-11-16 05:21:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 14 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (23), 16 states have call predecessors, (23), 14 states have call successors, (23) [2024-11-16 05:21:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2024-11-16 05:21:50,777 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 48 [2024-11-16 05:21:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:50,777 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2024-11-16 05:21:50,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 05:21:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2024-11-16 05:21:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 05:21:50,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:50,778 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:50,785 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 (18)] Ended with exit code 0 [2024-11-16 05:21:50,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:50,979 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:50,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash 35342743, now seen corresponding path program 1 times [2024-11-16 05:21:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:50,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180588586] [2024-11-16 05:21:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:50,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:50,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:50,982 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:50,983 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 (19)] Waiting until timeout for monitored process [2024-11-16 05:21:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:51,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 05:21:51,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 05:21:51,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:21:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 05:21:51,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180588586] [2024-11-16 05:21:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180588586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 05:21:51,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:21:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-11-16 05:21:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804677098] [2024-11-16 05:21:51,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:21:51,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 05:21:51,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 05:21:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-16 05:21:51,250 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 05:21:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:51,438 INFO L93 Difference]: Finished difference Result 86 states and 110 transitions. [2024-11-16 05:21:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 05:21:51,438 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2024-11-16 05:21:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:51,439 INFO L225 Difference]: With dead ends: 86 [2024-11-16 05:21:51,439 INFO L226 Difference]: Without dead ends: 70 [2024-11-16 05:21:51,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-16 05:21:51,440 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:51,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 368 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 05:21:51,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-16 05:21:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2024-11-16 05:21:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (22), 15 states have call predecessors, (22), 13 states have call successors, (22) [2024-11-16 05:21:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-16 05:21:51,443 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 48 [2024-11-16 05:21:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:51,444 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-16 05:21:51,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 05:21:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-16 05:21:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 05:21:51,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:51,444 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:51,448 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 (19)] Forceful destruction successful, exit code 0 [2024-11-16 05:21:51,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:51,648 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:51,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash 412956962, now seen corresponding path program 1 times [2024-11-16 05:21:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:51,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639908212] [2024-11-16 05:21:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:51,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:51,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:51,651 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:51,652 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 (20)] Waiting until timeout for monitored process [2024-11-16 05:21:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:51,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:51,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 05:21:51,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:51,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:51,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639908212] [2024-11-16 05:21:51,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639908212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:51,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:51,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:51,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988430263] [2024-11-16 05:21:51,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:51,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:51,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:51,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:51,712 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:51,738 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2024-11-16 05:21:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:51,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-16 05:21:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:51,739 INFO L225 Difference]: With dead ends: 98 [2024-11-16 05:21:51,739 INFO L226 Difference]: Without dead ends: 72 [2024-11-16 05:21:51,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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-11-16 05:21:51,740 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:51,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-16 05:21:51,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-11-16 05:21:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (22), 15 states have call predecessors, (22), 13 states have call successors, (22) [2024-11-16 05:21:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-16 05:21:51,743 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 49 [2024-11-16 05:21:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:51,744 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-16 05:21:51,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-16 05:21:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 05:21:51,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:51,744 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:51,748 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 (20)] Forceful destruction successful, exit code 0 [2024-11-16 05:21:51,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:51,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1728882138, now seen corresponding path program 1 times [2024-11-16 05:21:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:51,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350148724] [2024-11-16 05:21:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:51,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:51,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:51,948 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:51,949 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 (21)] Waiting until timeout for monitored process [2024-11-16 05:21:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:51,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:21:51,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 05:21:52,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:52,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:52,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350148724] [2024-11-16 05:21:52,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350148724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:52,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:52,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:21:52,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379607959] [2024-11-16 05:21:52,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:52,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:21:52,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:52,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:21:52,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:21:52,009 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:52,025 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2024-11-16 05:21:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:21:52,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-11-16 05:21:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:52,026 INFO L225 Difference]: With dead ends: 96 [2024-11-16 05:21:52,026 INFO L226 Difference]: Without dead ends: 70 [2024-11-16 05:21:52,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 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-11-16 05:21:52,027 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:52,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:21:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-16 05:21:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-11-16 05:21:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (18), 15 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-16 05:21:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-16 05:21:52,030 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 50 [2024-11-16 05:21:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:52,030 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-16 05:21:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:21:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-16 05:21:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 05:21:52,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:52,031 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:52,034 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 (21)] Forceful destruction successful, exit code 0 [2024-11-16 05:21:52,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:52,231 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:52,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1569012805, now seen corresponding path program 1 times [2024-11-16 05:21:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:52,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237367211] [2024-11-16 05:21:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:52,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:52,235 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:52,235 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 (22)] Waiting until timeout for monitored process [2024-11-16 05:21:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:52,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 05:21:52,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:52,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 05:21:52,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-16 05:21:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 05:21:52,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:52,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237367211] [2024-11-16 05:21:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237367211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:52,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:52,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 05:21:52,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503236408] [2024-11-16 05:21:52,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:52,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 05:21:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:52,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 05:21:52,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-16 05:21:52,668 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 05:21:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:53,243 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2024-11-16 05:21:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 05:21:53,244 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-11-16 05:21:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:53,245 INFO L225 Difference]: With dead ends: 70 [2024-11-16 05:21:53,245 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 05:21:53,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-11-16 05:21:53,246 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:53,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 421 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 05:21:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 05:21:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-16 05:21:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-16 05:21:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-16 05:21:53,249 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 50 [2024-11-16 05:21:53,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:53,249 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-16 05:21:53,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 05:21:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-11-16 05:21:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 05:21:53,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:53,250 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:53,257 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 (22)] Forceful destruction successful, exit code 0 [2024-11-16 05:21:53,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:53,451 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:53,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash 811800376, now seen corresponding path program 1 times [2024-11-16 05:21:53,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:53,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005476419] [2024-11-16 05:21:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:53,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:53,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:53,454 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:53,455 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 (23)] Waiting until timeout for monitored process [2024-11-16 05:21:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:53,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 05:21:53,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 05:21:53,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:21:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-16 05:21:54,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005476419] [2024-11-16 05:21:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005476419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 05:21:54,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:21:54,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-11-16 05:21:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70456491] [2024-11-16 05:21:54,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:21:54,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-16 05:21:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-16 05:21:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-16 05:21:54,812 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 05:21:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:55,232 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-11-16 05:21:55,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 05:21:55,232 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 55 [2024-11-16 05:21:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:55,233 INFO L225 Difference]: With dead ends: 78 [2024-11-16 05:21:55,233 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 05:21:55,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2024-11-16 05:21:55,234 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:55,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 215 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 05:21:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 05:21:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-16 05:21:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 05:21:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-16 05:21:55,237 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 55 [2024-11-16 05:21:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:55,237 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-16 05:21:55,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 05:21:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-16 05:21:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 05:21:55,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:55,238 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:55,243 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 (23)] Forceful destruction successful, exit code 0 [2024-11-16 05:21:55,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:55,439 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1035464326, now seen corresponding path program 1 times [2024-11-16 05:21:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:55,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259137771] [2024-11-16 05:21:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:55,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:55,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:55,442 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:55,443 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 (24)] Waiting until timeout for monitored process [2024-11-16 05:21:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:55,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 05:21:55,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:55,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 05:21:55,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-16 05:21:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 05:21:55,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:55,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259137771] [2024-11-16 05:21:55,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259137771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:55,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:55,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 05:21:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771446410] [2024-11-16 05:21:55,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:55,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 05:21:55,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:55,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 05:21:55,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 05:21:55,756 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 05:21:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:56,459 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-11-16 05:21:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 05:21:56,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2024-11-16 05:21:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:56,462 INFO L225 Difference]: With dead ends: 66 [2024-11-16 05:21:56,462 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 05:21:56,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-16 05:21:56,462 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:56,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 263 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 05:21:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 05:21:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-16 05:21:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-16 05:21:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-16 05:21:56,465 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 60 [2024-11-16 05:21:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:56,468 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-16 05:21:56,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 05:21:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-16 05:21:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-16 05:21:56,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:56,468 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:56,475 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 (24)] Ended with exit code 0 [2024-11-16 05:21:56,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:56,669 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:56,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:56,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2059987686, now seen corresponding path program 1 times [2024-11-16 05:21:56,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:56,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264730292] [2024-11-16 05:21:56,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:56,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:56,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:56,672 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:56,673 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 (25)] Waiting until timeout for monitored process [2024-11-16 05:21:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:56,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 05:21:56,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 05:21:56,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:56,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:56,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264730292] [2024-11-16 05:21:56,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264730292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:56,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:56,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 05:21:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280572121] [2024-11-16 05:21:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:56,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 05:21:56,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 05:21:56,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 05:21:56,884 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 05:21:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:57,257 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-11-16 05:21:57,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 05:21:57,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2024-11-16 05:21:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:57,258 INFO L225 Difference]: With dead ends: 68 [2024-11-16 05:21:57,258 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 05:21:57,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-16 05:21:57,259 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:57,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 270 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 05:21:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 05:21:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-16 05:21:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-16 05:21:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-16 05:21:57,264 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 61 [2024-11-16 05:21:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:57,264 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-16 05:21:57,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 05:21:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-16 05:21:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 05:21:57,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:57,265 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:57,271 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 (25)] Ended with exit code 0 [2024-11-16 05:21:57,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:57,466 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:57,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1616191817, now seen corresponding path program 1 times [2024-11-16 05:21:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:57,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303222914] [2024-11-16 05:21:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:57,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:57,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:57,469 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:57,470 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 (26)] Waiting until timeout for monitored process [2024-11-16 05:21:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:57,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 05:21:57,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 05:21:57,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:57,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:57,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303222914] [2024-11-16 05:21:57,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303222914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:57,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:57,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 05:21:57,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806471353] [2024-11-16 05:21:57,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:57,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 05:21:57,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:57,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 05:21:57,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 05:21:57,678 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 05:21:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:21:57,940 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2024-11-16 05:21:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 05:21:57,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2024-11-16 05:21:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:21:57,942 INFO L225 Difference]: With dead ends: 68 [2024-11-16 05:21:57,942 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 05:21:57,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-16 05:21:57,942 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 13 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 05:21:57,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 270 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 05:21:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 05:21:57,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-16 05:21:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-16 05:21:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-16 05:21:57,945 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 62 [2024-11-16 05:21:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:21:57,945 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-16 05:21:57,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 05:21:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-16 05:21:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 05:21:57,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:21:57,946 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:21:57,950 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 (26)] Ended with exit code 0 [2024-11-16 05:21:58,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:58,147 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:21:58,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:21:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1395827191, now seen corresponding path program 1 times [2024-11-16 05:21:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:21:58,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953955301] [2024-11-16 05:21:58,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:21:58,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:21:58,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:21:58,150 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:21:58,151 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 (27)] Waiting until timeout for monitored process [2024-11-16 05:21:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:21:58,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 05:21:58,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:21:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 05:21:58,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:21:58,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:21:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953955301] [2024-11-16 05:21:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953955301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:21:58,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:21:58,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 05:21:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208383606] [2024-11-16 05:21:58,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:21:58,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 05:21:58,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:21:58,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 05:21:58,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 05:21:58,371 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 05:22:00,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 05:22:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:22:00,725 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-11-16 05:22:00,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 05:22:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2024-11-16 05:22:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:22:00,729 INFO L225 Difference]: With dead ends: 65 [2024-11-16 05:22:00,729 INFO L226 Difference]: Without dead ends: 48 [2024-11-16 05:22:00,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-16 05:22:00,730 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-16 05:22:00,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 262 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-16 05:22:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-16 05:22:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2024-11-16 05:22:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 05:22:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-16 05:22:00,738 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 63 [2024-11-16 05:22:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:22:00,738 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-16 05:22:00,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 05:22:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-16 05:22:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 05:22:00,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:22:00,739 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:22:00,747 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 (27)] Forceful destruction successful, exit code 0 [2024-11-16 05:22:00,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:22:00,940 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:22:00,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:22:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash 603076044, now seen corresponding path program 1 times [2024-11-16 05:22:00,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:22:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842943114] [2024-11-16 05:22:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:22:00,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:22:00,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:22:00,942 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:22:00,944 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 (28)] Waiting until timeout for monitored process [2024-11-16 05:22:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:22:01,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 05:22:01,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:22:01,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 05:22:01,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-16 05:22:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-16 05:22:01,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:22:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-16 05:22:01,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:22:01,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842943114] [2024-11-16 05:22:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842943114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 05:22:01,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:22:01,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-16 05:22:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804851352] [2024-11-16 05:22:01,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:22:01,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 05:22:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:22:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 05:22:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-16 05:22:01,401 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-16 05:22:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:22:01,822 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-11-16 05:22:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 05:22:01,823 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 63 [2024-11-16 05:22:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:22:01,823 INFO L225 Difference]: With dead ends: 64 [2024-11-16 05:22:01,823 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 05:22:01,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-16 05:22:01,824 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 05:22:01,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 424 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 05:22:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 05:22:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-16 05:22:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-16 05:22:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-16 05:22:01,827 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 63 [2024-11-16 05:22:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:22:01,827 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-16 05:22:01,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-16 05:22:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-16 05:22:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 05:22:01,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:22:01,828 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:22:01,832 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 (28)] Forceful destruction successful, exit code 0 [2024-11-16 05:22:02,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:22:02,029 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:22:02,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:22:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash 821930762, now seen corresponding path program 1 times [2024-11-16 05:22:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:22:02,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923775828] [2024-11-16 05:22:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:22:02,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:22:02,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:22:02,032 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:22:02,033 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 (29)] Waiting until timeout for monitored process [2024-11-16 05:22:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:22:02,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:22:02,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:22:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 05:22:02,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:22:02,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:22:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923775828] [2024-11-16 05:22:02,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923775828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:22:02,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:22:02,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:22:02,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041085259] [2024-11-16 05:22:02,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:22:02,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:22:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:22:02,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:22:02,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:22:02,107 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 05:22:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:22:02,117 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2024-11-16 05:22:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:22:02,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2024-11-16 05:22:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:22:02,118 INFO L225 Difference]: With dead ends: 66 [2024-11-16 05:22:02,118 INFO L226 Difference]: Without dead ends: 45 [2024-11-16 05:22:02,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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-11-16 05:22:02,119 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:22:02,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:22:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-16 05:22:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-16 05:22:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 05:22:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-11-16 05:22:02,121 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2024-11-16 05:22:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:22:02,122 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-11-16 05:22:02,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 05:22:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-16 05:22:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 05:22:02,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:22:02,122 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:22:02,126 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 (29)] Forceful destruction successful, exit code 0 [2024-11-16 05:22:02,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:22:02,326 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:22:02,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:22:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash -794328658, now seen corresponding path program 1 times [2024-11-16 05:22:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:22:02,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131245820] [2024-11-16 05:22:02,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:22:02,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:22:02,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:22:02,328 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:22:02,329 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 (30)] Waiting until timeout for monitored process [2024-11-16 05:22:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:22:02,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 05:22:02,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:22:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-16 05:22:02,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:22:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-16 05:22:02,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:22:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131245820] [2024-11-16 05:22:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131245820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 05:22:02,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 05:22:02,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-16 05:22:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873122191] [2024-11-16 05:22:02,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 05:22:02,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 05:22:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:22:02,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 05:22:02,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-16 05:22:02,665 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 05:22:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:22:02,782 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-11-16 05:22:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 05:22:02,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 64 [2024-11-16 05:22:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:22:02,783 INFO L225 Difference]: With dead ends: 46 [2024-11-16 05:22:02,783 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 05:22:02,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-16 05:22:02,783 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:22:02,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 300 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:22:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 05:22:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 05:22:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 05:22:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 05:22:02,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2024-11-16 05:22:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:22:02,784 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 05:22:02,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-16 05:22:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 05:22:02,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 05:22:02,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-16 05:22:02,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-16 05:22:02,791 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 (30)] Forceful destruction successful, exit code 0 [2024-11-16 05:22:02,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:22:02,993 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:22:02,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 05:22:03,798 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 05:22:03,809 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-16 05:22:03,809 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-16 05:22:03,825 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:22:03,826 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:22:03,828 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-16 05:22:03,833 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NumberFormatException: Character I is neither a decimal digit number, decimal point, nor "e" notation exponential mark. at java.base/java.math.BigDecimal.(BigDecimal.java:518) at java.base/java.math.BigDecimal.(BigDecimal.java:401) at java.base/java.math.BigDecimal.(BigDecimal.java:834) at java.base/java.math.BigDecimal.valueOf(BigDecimal.java:1304) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.getDecimalFromBinaryString(Boogie2ACSL.java:272) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.constructFloat(Boogie2ACSL.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateFunctionApplication(Boogie2ACSL.java:321) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:587) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:586) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:586) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:587) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateBinaryExpression(Boogie2ACSL.java:586) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateExpression(Boogie2ACSL.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Boogie2ACSL.translateEnsuresExpression(Boogie2ACSL.java:117) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateProcedureContract(CACSL2BoogieBacktranslator.java:809) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator.translateProcedureContract(CACSL2BoogieBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:338) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateProcedureContract(BacktranslationService.java:94) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-16 05:22:03,836 INFO L158 Benchmark]: Toolchain (without parser) took 28610.80ms. Allocated memory was 65.0MB in the beginning and 159.4MB in the end (delta: 94.4MB). Free memory was 32.4MB in the beginning and 88.4MB in the end (delta: -56.0MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-11-16 05:22:03,836 INFO L158 Benchmark]: CDTParser took 1.27ms. Allocated memory is still 46.1MB. Free memory was 27.8MB in the beginning and 27.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:22:03,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.91ms. Allocated memory is still 65.0MB. Free memory was 32.2MB in the beginning and 36.2MB in the end (delta: -4.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-16 05:22:03,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.26ms. Allocated memory is still 65.0MB. Free memory was 36.2MB in the beginning and 34.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:22:03,837 INFO L158 Benchmark]: Boogie Preprocessor took 56.01ms. Allocated memory is still 65.0MB. Free memory was 34.5MB in the beginning and 32.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:22:03,837 INFO L158 Benchmark]: IcfgBuilder took 414.23ms. Allocated memory is still 65.0MB. Free memory was 32.3MB in the beginning and 33.4MB in the end (delta: -1.1MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-16 05:22:03,837 INFO L158 Benchmark]: TraceAbstraction took 27831.23ms. Allocated memory was 65.0MB in the beginning and 159.4MB in the end (delta: 94.4MB). Free memory was 32.9MB in the beginning and 88.4MB in the end (delta: -55.6MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. [2024-11-16 05:22:03,838 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27ms. Allocated memory is still 46.1MB. Free memory was 27.8MB in the beginning and 27.8MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.91ms. Allocated memory is still 65.0MB. Free memory was 32.2MB in the beginning and 36.2MB in the end (delta: -4.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.26ms. Allocated memory is still 65.0MB. Free memory was 36.2MB in the beginning and 34.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.01ms. Allocated memory is still 65.0MB. Free memory was 34.5MB in the beginning and 32.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 414.23ms. Allocated memory is still 65.0MB. Free memory was 32.3MB in the beginning and 33.4MB in the end (delta: -1.1MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27831.23ms. Allocated memory was 65.0MB in the beginning and 159.4MB in the end (delta: 94.4MB). Free memory was 32.9MB in the beginning and 88.4MB in the end (delta: -55.6MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 82]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 26.9s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 512 mSDsluCounter, 8680 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7112 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3930 IncrementalHoareTripleChecker+Invalid, 4043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 1568 mSDtfsCounter, 3930 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1915 GetRequests, 1646 SyntacticMatches, 4 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=14, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 161 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1782 ConstructedInterpolants, 12 QuantifiedInterpolants, 6008 SizeOfPredicates, 47 NumberOfNonLiveVariables, 3124 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 948/1076 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 25]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 57]: Procedure Contract for isnan_float Derived contract for procedure isnan_float. Ensures: ((0 == \result) || (1 == \result)) - ExceptionOrErrorResult: NumberFormatException: Character I is neither a decimal digit number, decimal point, nor "e" notation exponential mark. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NumberFormatException: Character I is neither a decimal digit number, decimal point, nor "e" notation exponential mark.: java.base/java.math.BigDecimal.(BigDecimal.java:518) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-16 05:22:03,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NumberFormatException: Character I is neither a decimal digit number, decimal point, nor "e" notation exponential mark.