./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_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-dev-4a390ef-m [2024-10-23 22:33:52,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:33:52,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 22:33:52,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:33:52,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:33:52,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:33:52,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:33:52,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:33:52,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:33:52,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:33:52,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:33:52,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:33:52,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:33:52,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:33:52,520 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:33:52,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:33:52,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:33:52,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:33:52,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 22:33:52,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:33:52,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:33:52,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:33:52,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:33:52,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:33:52,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:33:52,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:33:52,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:33:52,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:33:52,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:33:52,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:33:52,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:33:52,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:33:52,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:52,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:33:52,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:33:52,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:33:52,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 22:33:52,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 22:33:52,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:33:52,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:33:52,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:33:52,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:33:52,529 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-10-23 22:33:52,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:33:52,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:33:52,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:33:52,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:33:52,756 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:33:52,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-10-23 22:33:54,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:33:54,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:33:54,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-10-23 22:33:54,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c682bcd5b/1ec0f10885894265bb719ac11ee72474/FLAGe3076a27a [2024-10-23 22:33:54,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c682bcd5b/1ec0f10885894265bb719ac11ee72474 [2024-10-23 22:33:54,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:33:54,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:33:54,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:54,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:33:54,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:33:54,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255e461d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54, skipping insertion in model container [2024-10-23 22:33:54,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:33:54,569 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2024-10-23 22:33:54,573 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2024-10-23 22:33:54,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:54,583 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 22:33:54,604 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2024-10-23 22:33:54,605 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2024-10-23 22:33:54,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:54,627 INFO L204 MainTranslator]: Completed translation [2024-10-23 22:33:54,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54 WrapperNode [2024-10-23 22:33:54,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:54,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 22:33:54,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 22:33:54,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 22:33:54,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,663 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-10-23 22:33:54,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 22:33:54,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 22:33:54,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 22:33:54,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 22:33:54,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,695 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-10-23 22:33:54,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 22:33:54,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 22:33:54,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 22:33:54,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 22:33:54,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (1/1) ... [2024-10-23 22:33:54,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:54,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 22:33:54,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 22:33:54,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 22:33:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 22:33:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 22:33:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 22:33:54,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 22:33:54,853 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-23 22:33:54,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-23 22:33:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-10-23 22:33:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-10-23 22:33:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-23 22:33:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-23 22:33:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 22:33:54,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 22:33:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 22:33:54,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 22:33:54,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 22:33:54,926 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 22:33:54,928 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 22:33:55,082 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-23 22:33:55,082 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 22:33:55,098 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 22:33:55,100 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-23 22:33:55,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:55 BoogieIcfgContainer [2024-10-23 22:33:55,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 22:33:55,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 22:33:55,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 22:33:55,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 22:33:55,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:33:54" (1/3) ... [2024-10-23 22:33:55,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7049cf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:33:55, skipping insertion in model container [2024-10-23 22:33:55,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:54" (2/3) ... [2024-10-23 22:33:55,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7049cf59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:33:55, skipping insertion in model container [2024-10-23 22:33:55,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:55" (3/3) ... [2024-10-23 22:33:55,108 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2024-10-23 22:33:55,121 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 22:33:55,122 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-23 22:33:55,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 22:33:55,179 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;@6363813c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 22:33:55,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-23 22:33:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 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-10-23 22:33:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-23 22:33:55,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:55,191 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:33:55,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:55,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash -234746944, now seen corresponding path program 1 times [2024-10-23 22:33:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:55,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721783375] [2024-10-23 22:33:55,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:55,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-23 22:33:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:55,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-23 22:33:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-23 22:33:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721783375] [2024-10-23 22:33:55,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721783375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:55,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:55,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:55,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390670851] [2024-10-23 22:33:55,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:55,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:55,507 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 39 states have internal predecessors, (55), 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 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-10-23 22:33:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:55,626 INFO L93 Difference]: Finished difference Result 92 states and 134 transitions. [2024-10-23 22:33:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2024-10-23 22:33:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:55,634 INFO L225 Difference]: With dead ends: 92 [2024-10-23 22:33:55,634 INFO L226 Difference]: Without dead ends: 51 [2024-10-23 22:33:55,638 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-10-23 22:33:55,641 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 215 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-10-23 22:33:55,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 215 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:33:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-23 22:33:55,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-23 22:33:55,669 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-10-23 22:33:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-10-23 22:33:55,672 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 25 [2024-10-23 22:33:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:55,673 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-10-23 22:33:55,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-10-23 22:33:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-10-23 22:33:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-23 22:33:55,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:55,674 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:33:55,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 22:33:55,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:55,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash -317048565, now seen corresponding path program 1 times [2024-10-23 22:33:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:55,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8082466] [2024-10-23 22:33:55,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:55,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:55,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:55,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-23 22:33:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:33:55,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:55,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8082466] [2024-10-23 22:33:55,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8082466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:55,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:55,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:55,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581711954] [2024-10-23 22:33:55,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:55,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:55,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:55,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:55,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:55,824 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. 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, (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-10-23 22:33:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:55,918 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2024-10-23 22:33:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:55,919 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, (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 30 [2024-10-23 22:33:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:55,920 INFO L225 Difference]: With dead ends: 74 [2024-10-23 22:33:55,921 INFO L226 Difference]: Without dead ends: 55 [2024-10-23 22:33:55,921 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-10-23 22:33:55,922 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 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-10-23 22:33:55,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:33:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-23 22:33:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-23 22:33:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 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-10-23 22:33:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-23 22:33:55,936 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 30 [2024-10-23 22:33:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:55,936 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-23 22:33:55,937 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, (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-10-23 22:33:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-23 22:33:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-23 22:33:55,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:55,938 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:33:55,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 22:33:55,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:55,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1383658216, now seen corresponding path program 1 times [2024-10-23 22:33:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217494579] [2024-10-23 22:33:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-23 22:33:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:33:56,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:56,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217494579] [2024-10-23 22:33:56,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217494579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:56,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:56,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:56,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874762848] [2024-10-23 22:33:56,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:56,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:56,056 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-10-23 22:33:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:56,119 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-10-23 22:33:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:56,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 31 [2024-10-23 22:33:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:56,120 INFO L225 Difference]: With dead ends: 78 [2024-10-23 22:33:56,121 INFO L226 Difference]: Without dead ends: 59 [2024-10-23 22:33:56,121 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-10-23 22:33:56,122 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 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-10-23 22:33:56,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:33:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-23 22:33:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-10-23 22:33:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 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-10-23 22:33:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-23 22:33:56,129 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 31 [2024-10-23 22:33:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:56,129 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-23 22:33:56,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-10-23 22:33:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-23 22:33:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-23 22:33:56,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:56,130 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:33:56,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 22:33:56,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:56,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1392348847, now seen corresponding path program 1 times [2024-10-23 22:33:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:56,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922985329] [2024-10-23 22:33:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-23 22:33:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:33:56,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:56,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922985329] [2024-10-23 22:33:56,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922985329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:56,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:56,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:56,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101328440] [2024-10-23 22:33:56,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:56,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:56,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:56,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:56,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:56,333 INFO L87 Difference]: Start difference. First operand 55 states and 74 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-10-23 22:33:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:56,404 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-10-23 22:33:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:56,405 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 32 [2024-10-23 22:33:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:56,406 INFO L225 Difference]: With dead ends: 78 [2024-10-23 22:33:56,406 INFO L226 Difference]: Without dead ends: 59 [2024-10-23 22:33:56,406 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-10-23 22:33:56,408 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 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-10-23 22:33:56,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:33:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-23 22:33:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-10-23 22:33:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 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-10-23 22:33:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-23 22:33:56,421 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 32 [2024-10-23 22:33:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:56,421 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-23 22:33:56,422 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-10-23 22:33:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-23 22:33:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-23 22:33:56,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:56,423 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:33:56,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 22:33:56,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:56,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:56,425 INFO L85 PathProgramCache]: Analyzing trace with hash 488146380, now seen corresponding path program 1 times [2024-10-23 22:33:56,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:56,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859674863] [2024-10-23 22:33:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:56,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-23 22:33:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:33:56,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:56,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859674863] [2024-10-23 22:33:56,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859674863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:56,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:56,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263795628] [2024-10-23 22:33:56,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:56,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:56,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:56,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:56,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:56,584 INFO L87 Difference]: Start difference. First operand 55 states and 74 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-10-23 22:33:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:56,645 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-10-23 22:33:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:56,645 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 33 [2024-10-23 22:33:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:56,646 INFO L225 Difference]: With dead ends: 78 [2024-10-23 22:33:56,646 INFO L226 Difference]: Without dead ends: 59 [2024-10-23 22:33:56,646 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-10-23 22:33:56,647 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 221 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-10-23 22:33:56,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 221 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:33:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-23 22:33:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-10-23 22:33:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 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-10-23 22:33:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-23 22:33:56,653 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 33 [2024-10-23 22:33:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:56,653 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-23 22:33:56,653 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-10-23 22:33:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-23 22:33:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-23 22:33:56,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:56,654 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:33:56,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 22:33:56,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:56,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:56,655 INFO L85 PathProgramCache]: Analyzing trace with hash 194743373, now seen corresponding path program 1 times [2024-10-23 22:33:56,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:56,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613149993] [2024-10-23 22:33:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:56,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-23 22:33:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:33:56,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:56,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613149993] [2024-10-23 22:33:56,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613149993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:56,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:56,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:33:56,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065649697] [2024-10-23 22:33:56,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:56,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:33:56,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:56,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:33:56,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:33:56,726 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-10-23 22:33:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:56,816 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-10-23 22:33:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:33:56,818 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), 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 33 [2024-10-23 22:33:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:56,819 INFO L225 Difference]: With dead ends: 58 [2024-10-23 22:33:56,819 INFO L226 Difference]: Without dead ends: 56 [2024-10-23 22:33:56,819 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-10-23 22:33:56,819 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 22:33:56,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:33:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-23 22:33:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-23 22:33:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 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-10-23 22:33:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2024-10-23 22:33:56,831 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 33 [2024-10-23 22:33:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:56,832 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2024-10-23 22:33:56,832 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), 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-10-23 22:33:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2024-10-23 22:33:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-23 22:33:56,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:56,834 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:33:56,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 22:33:56,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:56,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash 750140511, now seen corresponding path program 1 times [2024-10-23 22:33:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:56,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675985979] [2024-10-23 22:33:56,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:33:56,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 22:33:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:33:56,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-23 22:33:56,900 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 22:33:56,901 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-23 22:33:56,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-23 22:33:56,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 22:33:56,905 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:33:56,928 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 22:33:56,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:33:56 BoogieIcfgContainer [2024-10-23 22:33:56,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 22:33:56,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 22:33:56,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 22:33:56,932 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 22:33:56,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:55" (3/4) ... [2024-10-23 22:33:56,934 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-23 22:33:56,935 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 22:33:56,936 INFO L158 Benchmark]: Toolchain (without parser) took 2559.75ms. Allocated memory is still 180.4MB. Free memory was 111.7MB in the beginning and 71.6MB in the end (delta: 40.0MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2024-10-23 22:33:56,936 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:56,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.38ms. Allocated memory is still 180.4MB. Free memory was 111.4MB in the beginning and 98.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 22:33:56,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.28ms. Allocated memory is still 180.4MB. Free memory was 98.3MB in the beginning and 96.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:56,938 INFO L158 Benchmark]: Boogie Preprocessor took 51.28ms. Allocated memory is still 180.4MB. Free memory was 96.7MB in the beginning and 94.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:33:56,938 INFO L158 Benchmark]: RCFGBuilder took 385.55ms. Allocated memory is still 180.4MB. Free memory was 94.4MB in the beginning and 136.8MB in the end (delta: -42.4MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-23 22:33:56,938 INFO L158 Benchmark]: TraceAbstraction took 1828.61ms. Allocated memory is still 180.4MB. Free memory was 135.9MB in the beginning and 71.6MB in the end (delta: 64.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-23 22:33:56,939 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 180.4MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:56,939 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 180.4MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.38ms. Allocated memory is still 180.4MB. Free memory was 111.4MB in the beginning and 98.5MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.28ms. Allocated memory is still 180.4MB. Free memory was 98.3MB in the beginning and 96.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.28ms. Allocated memory is still 180.4MB. Free memory was 96.7MB in the beginning and 94.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.55ms. Allocated memory is still 180.4MB. Free memory was 94.4MB in the beginning and 136.8MB in the end (delta: -42.4MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1828.61ms. Allocated memory is still 180.4MB. Free memory was 135.9MB in the beginning and 71.6MB in the end (delta: 64.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 180.4MB. Free memory is still 71.6MB. 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; [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; [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 [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; [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; [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, 52 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 1240 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 849 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 391 mSDtfsCounter, 290 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=56occurred 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 32/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-23 22:33:56,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/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-dev-4a390ef-m [2024-10-23 22:33:58,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:33:59,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-23 22:33:59,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:33:59,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:33:59,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:33:59,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:33:59,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:33:59,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:33:59,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:33:59,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:33:59,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:33:59,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:33:59,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:33:59,070 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:33:59,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:33:59,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:33:59,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:33:59,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:33:59,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:33:59,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:33:59,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:33:59,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:33:59,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-23 22:33:59,076 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-23 22:33:59,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:33:59,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-23 22:33:59,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:33:59,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:33:59,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:33:59,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:33:59,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:33:59,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:33:59,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:33:59,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:59,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:33:59,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:33:59,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:33:59,078 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-23 22:33:59,078 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-23 22:33:59,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:33:59,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:33:59,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:33:59,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:33:59,079 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-23 22:33:59,080 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-10-23 22:33:59,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:33:59,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:33:59,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:33:59,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:33:59,347 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:33:59,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-10-23 22:34:00,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:34:01,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:34:01,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2024-10-23 22:34:01,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a492788/466924a2abe04e449aa20626afcd45ef/FLAG559015264 [2024-10-23 22:34:01,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79a492788/466924a2abe04e449aa20626afcd45ef [2024-10-23 22:34:01,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:34:01,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:34:01,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:34:01,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:34:01,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:34:01,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da24f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01, skipping insertion in model container [2024-10-23 22:34:01,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:34:01,236 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2024-10-23 22:34:01,241 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2024-10-23 22:34:01,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:34:01,258 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 22:34:01,278 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[1980,1993] [2024-10-23 22:34:01,279 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c[2139,2152] [2024-10-23 22:34:01,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:34:01,297 INFO L204 MainTranslator]: Completed translation [2024-10-23 22:34:01,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01 WrapperNode [2024-10-23 22:34:01,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 22:34:01,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 22:34:01,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 22:34:01,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 22:34:01,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,372 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-10-23 22:34:01,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 22:34:01,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 22:34:01,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 22:34:01,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 22:34:01,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,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-10-23 22:34:01,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 22:34:01,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 22:34:01,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 22:34:01,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 22:34:01,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (1/1) ... [2024-10-23 22:34:01,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:34:01,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 22:34:01,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 22:34:01,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 22:34:01,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 22:34:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-23 22:34:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-23 22:34:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 22:34:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-23 22:34:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-23 22:34:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-10-23 22:34:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-10-23 22:34:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-23 22:34:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-23 22:34:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 22:34:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 22:34:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-23 22:34:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-23 22:34:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 22:34:01,606 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 22:34:01,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 22:34:01,781 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-23 22:34:01,781 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 22:34:01,800 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 22:34:01,801 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-23 22:34:01,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:34:01 BoogieIcfgContainer [2024-10-23 22:34:01,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 22:34:01,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 22:34:01,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 22:34:01,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 22:34:01,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:34:01" (1/3) ... [2024-10-23 22:34:01,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6005e935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:34:01, skipping insertion in model container [2024-10-23 22:34:01,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:34:01" (2/3) ... [2024-10-23 22:34:01,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6005e935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:34:01, skipping insertion in model container [2024-10-23 22:34:01,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:34:01" (3/3) ... [2024-10-23 22:34:01,808 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2024-10-23 22:34:01,821 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 22:34:01,821 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-23 22:34:01,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 22:34:01,869 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;@1925dae5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 22:34:01,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-23 22:34:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 37 states have internal predecessors, (53), 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-10-23 22:34:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-23 22:34:01,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:01,879 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:34:01,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:01,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash -338858700, now seen corresponding path program 1 times [2024-10-23 22:34:01,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:01,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665637868] [2024-10-23 22:34:01,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:01,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:01,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-23 22:34:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:01,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-23 22:34:01,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:34:02,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:02,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:02,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665637868] [2024-10-23 22:34:02,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665637868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:02,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:02,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 22:34:02,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248840068] [2024-10-23 22:34:02,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:02,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 22:34:02,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:02,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 22:34:02,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 22:34:02,047 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 37 states have internal predecessors, (53), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-10-23 22:34:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:02,077 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2024-10-23 22:34:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 22:34:02,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 24 [2024-10-23 22:34:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:02,085 INFO L225 Difference]: With dead ends: 84 [2024-10-23 22:34:02,086 INFO L226 Difference]: Without dead ends: 47 [2024-10-23 22:34:02,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 22:34:02,095 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:02,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-23 22:34:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-23 22:34:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 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-10-23 22:34:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-10-23 22:34:02,132 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 24 [2024-10-23 22:34:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:02,133 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-10-23 22:34:02,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-10-23 22:34:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-10-23 22:34:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-23 22:34:02,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:02,135 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:02,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-23 22:34:02,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:02,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:02,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash -43049946, now seen corresponding path program 1 times [2024-10-23 22:34:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318863082] [2024-10-23 22:34:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:02,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:02,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:02,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:02,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-23 22:34:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:02,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:02,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:34:02,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:02,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318863082] [2024-10-23 22:34:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318863082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:02,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:02,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:02,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021961792] [2024-10-23 22:34:02,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:02,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:02,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:02,467 INFO L87 Difference]: Start difference. First operand 47 states and 65 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-10-23 22:34:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:02,499 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-10-23 22:34:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 25 [2024-10-23 22:34:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:02,502 INFO L225 Difference]: With dead ends: 82 [2024-10-23 22:34:02,503 INFO L226 Difference]: Without dead ends: 49 [2024-10-23 22:34:02,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:02,505 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:02,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-23 22:34:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-23 22:34:02,514 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-10-23 22:34:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-10-23 22:34:02,515 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 25 [2024-10-23 22:34:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:02,515 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-10-23 22:34:02,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-10-23 22:34:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-10-23 22:34:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-23 22:34:02,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:02,517 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:02,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:02,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:02,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:02,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1978510601, now seen corresponding path program 1 times [2024-10-23 22:34:02,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475896902] [2024-10-23 22:34:02,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:02,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:02,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:02,724 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:02,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-23 22:34:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:02,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:02,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-23 22:34:02,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:02,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:02,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475896902] [2024-10-23 22:34:02,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475896902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:02,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:02,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:02,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94464856] [2024-10-23 22:34:02,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:02,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:02,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:02,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:02,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:02,836 INFO L87 Difference]: Start difference. First operand 49 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-10-23 22:34:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:02,879 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2024-10-23 22:34:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:02,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 29 [2024-10-23 22:34:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:02,884 INFO L225 Difference]: With dead ends: 71 [2024-10-23 22:34:02,885 INFO L226 Difference]: Without dead ends: 52 [2024-10-23 22:34:02,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:02,887 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:02,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-23 22:34:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-23 22:34:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 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), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-23 22:34:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-23 22:34:02,900 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 29 [2024-10-23 22:34:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:02,900 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-23 22:34:02,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-10-23 22:34:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-23 22:34:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-23 22:34:02,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:02,902 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:02,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-23 22:34:03,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:03,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:03,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2001085390, now seen corresponding path program 1 times [2024-10-23 22:34:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132964137] [2024-10-23 22:34:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:03,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:03,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:03,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:03,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-23 22:34:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:03,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:03,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-23 22:34:03,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:03,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:03,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132964137] [2024-10-23 22:34:03,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132964137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:03,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:03,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512829900] [2024-10-23 22:34:03,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:03,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:03,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:03,212 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-10-23 22:34:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:03,250 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-10-23 22:34:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:03,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 30 [2024-10-23 22:34:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:03,253 INFO L225 Difference]: With dead ends: 74 [2024-10-23 22:34:03,253 INFO L226 Difference]: Without dead ends: 55 [2024-10-23 22:34:03,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:03,254 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:03,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-23 22:34:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-23 22:34:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 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), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-23 22:34:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-23 22:34:03,267 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 30 [2024-10-23 22:34:03,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:03,267 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-23 22:34:03,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-10-23 22:34:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-23 22:34:03,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-23 22:34:03,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:03,270 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:03,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-23 22:34:03,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:03,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:03,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1077732571, now seen corresponding path program 1 times [2024-10-23 22:34:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:03,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382725380] [2024-10-23 22:34:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:03,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:03,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:03,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:03,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-23 22:34:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:03,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:03,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-23 22:34:03,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:03,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:03,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382725380] [2024-10-23 22:34:03,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382725380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:03,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:03,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033819648] [2024-10-23 22:34:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:03,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:03,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:03,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:03,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:03,599 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-10-23 22:34:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:03,622 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-10-23 22:34:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:03,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 31 [2024-10-23 22:34:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:03,623 INFO L225 Difference]: With dead ends: 74 [2024-10-23 22:34:03,623 INFO L226 Difference]: Without dead ends: 55 [2024-10-23 22:34:03,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:03,624 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:03,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-23 22:34:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-23 22:34:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 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), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-23 22:34:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-23 22:34:03,629 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 31 [2024-10-23 22:34:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:03,630 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-23 22:34:03,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-10-23 22:34:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-23 22:34:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-23 22:34:03,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:03,631 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:03,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-23 22:34:03,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:03,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:03,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1515477974, now seen corresponding path program 1 times [2024-10-23 22:34:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:03,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905339191] [2024-10-23 22:34:03,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:03,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:03,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:03,837 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:03,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-23 22:34:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:03,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:03,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-23 22:34:03,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:03,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905339191] [2024-10-23 22:34:03,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905339191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:03,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:03,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338004296] [2024-10-23 22:34:03,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:03,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:03,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:03,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:03,899 INFO L87 Difference]: Start difference. First operand 52 states and 71 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-10-23 22:34:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:03,924 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-10-23 22:34:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:03,925 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 32 [2024-10-23 22:34:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:03,926 INFO L225 Difference]: With dead ends: 74 [2024-10-23 22:34:03,926 INFO L226 Difference]: Without dead ends: 55 [2024-10-23 22:34:03,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:03,927 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:03,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-23 22:34:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-23 22:34:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 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), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-23 22:34:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-23 22:34:03,932 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 32 [2024-10-23 22:34:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:03,932 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-23 22:34:03,932 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-10-23 22:34:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-23 22:34:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-23 22:34:03,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:03,933 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:03,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-23 22:34:04,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:04,137 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:04,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:04,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1386395255, now seen corresponding path program 1 times [2024-10-23 22:34:04,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:04,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621896763] [2024-10-23 22:34:04,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:04,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-10-23 22:34:04,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:04,139 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:04,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-23 22:34:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:04,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:04,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:34:04,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 22:34:04,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621896763] [2024-10-23 22:34:04,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621896763] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:04,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:04,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-10-23 22:34:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401449464] [2024-10-23 22:34:04,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:04,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-23 22:34:04,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-23 22:34:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-23 22:34:04,685 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 13 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 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-10-23 22:34:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:04,999 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2024-10-23 22:34:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-23 22:34:05,000 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 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 32 [2024-10-23 22:34:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:05,001 INFO L225 Difference]: With dead ends: 93 [2024-10-23 22:34:05,001 INFO L226 Difference]: Without dead ends: 80 [2024-10-23 22:34:05,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 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-10-23 22:34:05,002 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 39 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:05,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 643 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 22:34:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-23 22:34:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2024-10-23 22:34:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-10-23 22:34:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2024-10-23 22:34:05,012 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 32 [2024-10-23 22:34:05,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:05,012 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2024-10-23 22:34:05,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 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-10-23 22:34:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2024-10-23 22:34:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-23 22:34:05,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:05,013 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:05,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-23 22:34:05,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:05,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1403277256, now seen corresponding path program 1 times [2024-10-23 22:34:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329912740] [2024-10-23 22:34:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:05,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:05,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:05,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:05,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-23 22:34:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:05,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:05,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-23 22:34:05,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:05,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:05,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329912740] [2024-10-23 22:34:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329912740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:05,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-23 22:34:05,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389097733] [2024-10-23 22:34:05,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:05,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-23 22:34:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-23 22:34:05,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-23 22:34:05,426 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-10-23 22:34:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:05,643 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2024-10-23 22:34:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-23 22:34:05,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 34 [2024-10-23 22:34:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:05,644 INFO L225 Difference]: With dead ends: 116 [2024-10-23 22:34:05,644 INFO L226 Difference]: Without dead ends: 79 [2024-10-23 22:34:05,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 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-10-23 22:34:05,645 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 22 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:05,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 461 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 22:34:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-23 22:34:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2024-10-23 22:34:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 states have internal predecessors, (62), 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-10-23 22:34:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-23 22:34:05,651 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 34 [2024-10-23 22:34:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:05,651 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-23 22:34:05,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-10-23 22:34:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-23 22:34:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-23 22:34:05,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:05,652 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:05,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-23 22:34:05,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:05,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:05,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1889405723, now seen corresponding path program 1 times [2024-10-23 22:34:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:05,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312376035] [2024-10-23 22:34:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:05,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:05,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:05,860 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:05,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-23 22:34:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:05,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-23 22:34:05,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-23 22:34:06,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-23 22:34:06,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:06,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312376035] [2024-10-23 22:34:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312376035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:06,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:06,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-10-23 22:34:06,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100059532] [2024-10-23 22:34:06,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:06,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-23 22:34:06,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:06,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-23 22:34:06,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-23 22:34:06,303 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-10-23 22:34:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:06,773 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2024-10-23 22:34:06,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-23 22:34:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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 36 [2024-10-23 22:34:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:06,775 INFO L225 Difference]: With dead ends: 106 [2024-10-23 22:34:06,775 INFO L226 Difference]: Without dead ends: 104 [2024-10-23 22:34:06,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-10-23 22:34:06,775 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 78 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:06,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 311 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 22:34:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-23 22:34:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 78. [2024-10-23 22:34:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 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-10-23 22:34:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-10-23 22:34:06,793 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 36 [2024-10-23 22:34:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:06,794 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-10-23 22:34:06,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-10-23 22:34:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-10-23 22:34:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-23 22:34:06,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:06,795 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:06,801 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-10-23 22:34:06,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:06,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:06,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1007976621, now seen corresponding path program 1 times [2024-10-23 22:34:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268064360] [2024-10-23 22:34:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:06,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:06,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:07,000 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:07,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-23 22:34:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:07,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 22:34:07,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-23 22:34:07,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:07,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:07,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268064360] [2024-10-23 22:34:07,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268064360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:07,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:07,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:34:07,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735857829] [2024-10-23 22:34:07,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:07,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:34:07,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:07,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:34:07,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:34:07,054 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-23 22:34:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:07,073 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2024-10-23 22:34:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:34:07,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 38 [2024-10-23 22:34:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:07,075 INFO L225 Difference]: With dead ends: 81 [2024-10-23 22:34:07,075 INFO L226 Difference]: Without dead ends: 79 [2024-10-23 22:34:07,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:34:07,076 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 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-10-23 22:34:07,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-23 22:34:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-10-23 22:34:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 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-10-23 22:34:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-10-23 22:34:07,097 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 38 [2024-10-23 22:34:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:07,098 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-10-23 22:34:07,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-23 22:34:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-10-23 22:34:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-23 22:34:07,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:07,099 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:07,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-23 22:34:07,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:07,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:07,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash 400442160, now seen corresponding path program 1 times [2024-10-23 22:34:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069814066] [2024-10-23 22:34:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:07,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:07,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:07,305 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:07,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-23 22:34:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:07,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:07,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-23 22:34:07,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:07,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:07,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069814066] [2024-10-23 22:34:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069814066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:07,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:07,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:07,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84337098] [2024-10-23 22:34:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:07,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:07,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:07,379 INFO L87 Difference]: Start difference. First operand 78 states and 111 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, (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-10-23 22:34:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:07,403 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2024-10-23 22:34:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:07,404 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, (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 41 [2024-10-23 22:34:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:07,405 INFO L225 Difference]: With dead ends: 106 [2024-10-23 22:34:07,405 INFO L226 Difference]: Without dead ends: 82 [2024-10-23 22:34:07,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:07,406 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:07,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-23 22:34:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-23 22:34:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 57 states have internal predecessors, (73), 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-10-23 22:34:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 119 transitions. [2024-10-23 22:34:07,413 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 119 transitions. Word has length 41 [2024-10-23 22:34:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:07,413 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 119 transitions. [2024-10-23 22:34:07,413 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, (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-10-23 22:34:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 119 transitions. [2024-10-23 22:34:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-23 22:34:07,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:07,418 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:07,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-23 22:34:07,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:07,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:07,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -186363854, now seen corresponding path program 1 times [2024-10-23 22:34:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:07,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896631713] [2024-10-23 22:34:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:07,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:07,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:07,623 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-10-23 22:34:07,624 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-10-23 22:34:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:07,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-23 22:34:07,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:07,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 22:34:07,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 22:34:08,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896631713] [2024-10-23 22:34:08,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896631713] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:08,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:08,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-10-23 22:34:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445468426] [2024-10-23 22:34:08,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:08,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-23 22:34:08,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:08,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-23 22:34:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-10-23 22:34:08,639 INFO L87 Difference]: Start difference. First operand 82 states and 119 transitions. Second operand has 23 states, 21 states have (on average 2.142857142857143) internal successors, (45), 19 states have internal predecessors, (45), 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-10-23 22:34:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:09,690 INFO L93 Difference]: Finished difference Result 144 states and 199 transitions. [2024-10-23 22:34:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-23 22:34:09,690 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.142857142857143) internal successors, (45), 19 states have internal predecessors, (45), 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 41 [2024-10-23 22:34:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:09,691 INFO L225 Difference]: With dead ends: 144 [2024-10-23 22:34:09,693 INFO L226 Difference]: Without dead ends: 108 [2024-10-23 22:34:09,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 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-10-23 22:34:09,694 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:09,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 904 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 22:34:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-23 22:34:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2024-10-23 22:34:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 57 states have internal predecessors, (73), 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-10-23 22:34:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2024-10-23 22:34:09,700 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 41 [2024-10-23 22:34:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:09,701 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2024-10-23 22:34:09,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.142857142857143) internal successors, (45), 19 states have internal predecessors, (45), 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-10-23 22:34:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2024-10-23 22:34:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-23 22:34:09,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:09,702 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:09,708 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 (13)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:09,905 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-10-23 22:34:09,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:09,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:09,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1566041830, now seen corresponding path program 1 times [2024-10-23 22:34:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:09,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611905849] [2024-10-23 22:34:09,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:09,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:09,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:09,910 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-10-23 22:34:09,915 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-10-23 22:34:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:09,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:09,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-23 22:34:10,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 22:34:10,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:10,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611905849] [2024-10-23 22:34:10,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611905849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:10,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:10,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-10-23 22:34:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939553691] [2024-10-23 22:34:10,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:10,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-23 22:34:10,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:10,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-23 22:34:10,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-23 22:34:10,409 INFO L87 Difference]: Start difference. First operand 82 states and 117 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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-10-23 22:34:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:10,635 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2024-10-23 22:34:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:10,635 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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 42 [2024-10-23 22:34:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:10,636 INFO L225 Difference]: With dead ends: 101 [2024-10-23 22:34:10,637 INFO L226 Difference]: Without dead ends: 81 [2024-10-23 22:34:10,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-23 22:34:10,637 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:10,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 469 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 22:34:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-23 22:34:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-23 22:34:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 55 states have internal predecessors, (67), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (24), 19 states have call predecessors, (24), 17 states have call successors, (24) [2024-10-23 22:34:10,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2024-10-23 22:34:10,652 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 108 transitions. Word has length 42 [2024-10-23 22:34:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:10,652 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 108 transitions. [2024-10-23 22:34:10,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 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-10-23 22:34:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 108 transitions. [2024-10-23 22:34:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-23 22:34:10,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:10,654 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:10,659 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 (14)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:10,854 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-10-23 22:34:10,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:10,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:10,855 INFO L85 PathProgramCache]: Analyzing trace with hash 888191559, now seen corresponding path program 1 times [2024-10-23 22:34:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:10,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735449633] [2024-10-23 22:34:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:10,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:10,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:10,858 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-10-23 22:34:10,860 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-10-23 22:34:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:10,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-23 22:34:10,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:34:11,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 22:34:11,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:11,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735449633] [2024-10-23 22:34:11,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735449633] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:11,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:11,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2024-10-23 22:34:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530886808] [2024-10-23 22:34:11,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-23 22:34:11,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-23 22:34:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-23 22:34:11,305 INFO L87 Difference]: Start difference. First operand 77 states and 108 transitions. Second operand has 14 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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-10-23 22:34:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:11,541 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2024-10-23 22:34:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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 42 [2024-10-23 22:34:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:11,543 INFO L225 Difference]: With dead ends: 109 [2024-10-23 22:34:11,543 INFO L226 Difference]: Without dead ends: 71 [2024-10-23 22:34:11,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 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-10-23 22:34:11,544 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:11,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 429 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 22:34:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-23 22:34:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-10-23 22:34:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 14 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (20), 16 states have call predecessors, (20), 14 states have call successors, (20) [2024-10-23 22:34:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2024-10-23 22:34:11,548 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 42 [2024-10-23 22:34:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:11,548 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2024-10-23 22:34:11,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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-10-23 22:34:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-10-23 22:34:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-23 22:34:11,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:11,549 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:11,556 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 (15)] Ended with exit code 0 [2024-10-23 22:34:11,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-10-23 22:34:11,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:11,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:11,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2044179483, now seen corresponding path program 1 times [2024-10-23 22:34:11,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:11,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693972678] [2024-10-23 22:34:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:11,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:11,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:11,757 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:11,758 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 (16)] Waiting until timeout for monitored process [2024-10-23 22:34:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:11,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:11,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-23 22:34:11,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 22:34:12,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:12,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693972678] [2024-10-23 22:34:12,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693972678] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:12,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:12,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-10-23 22:34:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32369367] [2024-10-23 22:34:12,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:12,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-23 22:34:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:12,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-23 22:34:12,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-23 22:34:12,025 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand has 12 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-10-23 22:34:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:12,204 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2024-10-23 22:34:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:12,205 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 42 [2024-10-23 22:34:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:12,205 INFO L225 Difference]: With dead ends: 81 [2024-10-23 22:34:12,205 INFO L226 Difference]: Without dead ends: 66 [2024-10-23 22:34:12,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-10-23 22:34:12,206 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 20 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:12,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 439 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:34:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-23 22:34:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-23 22:34:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (19), 15 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-23 22:34:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-10-23 22:34:12,210 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 42 [2024-10-23 22:34:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:12,210 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-10-23 22:34:12,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-10-23 22:34:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-10-23 22:34:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-23 22:34:12,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:12,211 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:12,217 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 (16)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:12,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:12,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:12,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1012738482, now seen corresponding path program 1 times [2024-10-23 22:34:12,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873304430] [2024-10-23 22:34:12,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:12,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:12,415 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-10-23 22:34:12,416 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-10-23 22:34:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:12,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:12,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-23 22:34:12,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:12,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873304430] [2024-10-23 22:34:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873304430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:12,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:12,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825560495] [2024-10-23 22:34:12,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:12,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:12,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:12,478 INFO L87 Difference]: Start difference. First operand 65 states and 86 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, (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-10-23 22:34:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:12,497 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2024-10-23 22:34:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:12,498 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, (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 43 [2024-10-23 22:34:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:12,499 INFO L225 Difference]: With dead ends: 93 [2024-10-23 22:34:12,499 INFO L226 Difference]: Without dead ends: 69 [2024-10-23 22:34:12,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:12,499 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:12,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-23 22:34:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-23 22:34:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (23), 16 states have call predecessors, (23), 13 states have call successors, (23) [2024-10-23 22:34:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2024-10-23 22:34:12,503 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 43 [2024-10-23 22:34:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:12,504 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2024-10-23 22:34:12,504 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, (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-10-23 22:34:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-10-23 22:34:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-23 22:34:12,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:12,504 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:12,511 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-10-23 22:34:12,708 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-10-23 22:34:12,708 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:12,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:12,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1599544496, now seen corresponding path program 1 times [2024-10-23 22:34:12,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:12,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662973454] [2024-10-23 22:34:12,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:12,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:12,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:12,712 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-10-23 22:34:12,713 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-10-23 22:34:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:12,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-23 22:34:12,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-23 22:34:13,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:13,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:13,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662973454] [2024-10-23 22:34:13,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662973454] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 22:34:13,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1653507381] [2024-10-23 22:34:13,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:13,467 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-23 22:34:13,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-23 22:34:13,469 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-23 22:34:13,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-10-23 22:34:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:13,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-23 22:34:13,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-23 22:34:13,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1653507381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 22:34:13,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:13,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2024-10-23 22:34:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933596193] [2024-10-23 22:34:13,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:13,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-23 22:34:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:13,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-23 22:34:13,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-10-23 22:34:13,986 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-10-23 22:34:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:14,311 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-10-23 22:34:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-23 22:34:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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 43 [2024-10-23 22:34:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:14,312 INFO L225 Difference]: With dead ends: 77 [2024-10-23 22:34:14,312 INFO L226 Difference]: Without dead ends: 67 [2024-10-23 22:34:14,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-10-23 22:34:14,313 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:14,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 327 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-23 22:34:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-23 22:34:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-23 22:34:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 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-10-23 22:34:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2024-10-23 22:34:14,324 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 43 [2024-10-23 22:34:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:14,326 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2024-10-23 22:34:14,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-10-23 22:34:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2024-10-23 22:34:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-23 22:34:14,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:14,327 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:14,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:14,531 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 (18)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:14,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-10-23 22:34:14,728 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:14,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash 510962961, now seen corresponding path program 1 times [2024-10-23 22:34:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:14,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359533619] [2024-10-23 22:34:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:14,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:14,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:14,732 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-10-23 22:34:14,737 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-10-23 22:34:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:14,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:14,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-23 22:34:14,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:14,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:14,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359533619] [2024-10-23 22:34:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359533619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:14,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:14,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964906084] [2024-10-23 22:34:14,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:14,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:14,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:14,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:14,840 INFO L87 Difference]: Start difference. First operand 67 states and 89 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, (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-10-23 22:34:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:14,875 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2024-10-23 22:34:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:14,876 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, (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 44 [2024-10-23 22:34:14,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:14,877 INFO L225 Difference]: With dead ends: 95 [2024-10-23 22:34:14,877 INFO L226 Difference]: Without dead ends: 70 [2024-10-23 22:34:14,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:14,878 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:14,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-23 22:34:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-10-23 22:34:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.148936170212766) internal successors, (54), 49 states have internal predecessors, (54), 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-10-23 22:34:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2024-10-23 22:34:14,885 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 44 [2024-10-23 22:34:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:14,885 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2024-10-23 22:34:14,885 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, (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-10-23 22:34:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2024-10-23 22:34:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-23 22:34:14,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:14,887 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:14,891 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 (20)] Ended with exit code 0 [2024-10-23 22:34:15,090 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-10-23 22:34:15,091 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:15,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:15,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1541069270, now seen corresponding path program 1 times [2024-10-23 22:34:15,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:15,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515160172] [2024-10-23 22:34:15,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:15,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:15,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:15,094 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-10-23 22:34:15,096 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-10-23 22:34:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:15,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:15,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-23 22:34:15,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:15,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:15,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515160172] [2024-10-23 22:34:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515160172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:15,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:15,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385304558] [2024-10-23 22:34:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:15,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:15,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:15,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:15,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:15,173 INFO L87 Difference]: Start difference. First operand 67 states and 89 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-10-23 22:34:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:15,260 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2024-10-23 22:34:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:15,260 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 45 [2024-10-23 22:34:15,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:15,261 INFO L225 Difference]: With dead ends: 93 [2024-10-23 22:34:15,261 INFO L226 Difference]: Without dead ends: 68 [2024-10-23 22:34:15,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:15,262 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:15,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:34:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-23 22:34:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2024-10-23 22:34:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 47 states have internal predecessors, (53), 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-10-23 22:34:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2024-10-23 22:34:15,266 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 45 [2024-10-23 22:34:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:15,267 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2024-10-23 22:34:15,267 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-10-23 22:34:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2024-10-23 22:34:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-23 22:34:15,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:15,268 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:15,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 (21)] Ended with exit code 0 [2024-10-23 22:34:15,471 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-10-23 22:34:15,471 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:15,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2051603447, now seen corresponding path program 1 times [2024-10-23 22:34:15,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:15,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590009690] [2024-10-23 22:34:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:15,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:15,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:15,475 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-10-23 22:34:15,476 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-10-23 22:34:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:15,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-23 22:34:15,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:15,625 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-10-23 22:34:15,627 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-10-23 22:34:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:34:15,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:15,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:15,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590009690] [2024-10-23 22:34:15,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590009690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-23 22:34:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123934624] [2024-10-23 22:34:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:15,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-23 22:34:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-23 22:34:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-23 22:34:15,862 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-10-23 22:34:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:16,340 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2024-10-23 22:34:16,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-23 22:34:16,341 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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 45 [2024-10-23 22:34:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:16,341 INFO L225 Difference]: With dead ends: 67 [2024-10-23 22:34:16,342 INFO L226 Difference]: Without dead ends: 47 [2024-10-23 22:34:16,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 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-10-23 22:34:16,342 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:16,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 317 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 22:34:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-23 22:34:16,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-10-23 22:34:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 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-10-23 22:34:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-10-23 22:34:16,346 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 45 [2024-10-23 22:34:16,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:16,346 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-10-23 22:34:16,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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-10-23 22:34:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2024-10-23 22:34:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-23 22:34:16,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:16,347 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:16,354 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-10-23 22:34:16,547 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-10-23 22:34:16,547 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:16,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:16,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1340619783, now seen corresponding path program 1 times [2024-10-23 22:34:16,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:16,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261442740] [2024-10-23 22:34:16,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:16,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:16,549 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-10-23 22:34:16,551 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-10-23 22:34:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:16,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-23 22:34:16,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 22:34:17,080 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-23 22:34:22,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:22,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261442740] [2024-10-23 22:34:22,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261442740] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:22,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:22,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-10-23 22:34:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509927057] [2024-10-23 22:34:22,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:22,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-23 22:34:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:22,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-23 22:34:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-10-23 22:34:22,239 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 22 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 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-10-23 22:34:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:22,695 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2024-10-23 22:34:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-23 22:34:22,695 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 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 48 [2024-10-23 22:34:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:22,696 INFO L225 Difference]: With dead ends: 75 [2024-10-23 22:34:22,696 INFO L226 Difference]: Without dead ends: 45 [2024-10-23 22:34:22,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 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-10-23 22:34:22,697 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:22,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 263 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 22:34:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-23 22:34:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-10-23 22:34:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-10-23 22:34:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-10-23 22:34:22,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 48 [2024-10-23 22:34:22,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:22,701 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-10-23 22:34:22,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 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-10-23 22:34:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-10-23 22:34:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-23 22:34:22,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:22,702 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:22,708 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 (23)] Ended with exit code 0 [2024-10-23 22:34:22,902 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-10-23 22:34:22,902 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:22,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash 263903100, now seen corresponding path program 1 times [2024-10-23 22:34:22,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832861712] [2024-10-23 22:34:22,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:22,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:22,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:22,906 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-10-23 22:34:22,907 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-10-23 22:34:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:22,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-23 22:34:22,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:23,073 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-10-23 22:34:23,075 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-10-23 22:34:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-23 22:34:23,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:23,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:23,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832861712] [2024-10-23 22:34:23,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832861712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:23,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:23,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-23 22:34:23,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209869851] [2024-10-23 22:34:23,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:23,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 22:34:23,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:23,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 22:34:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-23 22:34:23,109 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-10-23 22:34:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:23,421 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2024-10-23 22:34:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:23,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 53 [2024-10-23 22:34:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:23,424 INFO L225 Difference]: With dead ends: 63 [2024-10-23 22:34:23,424 INFO L226 Difference]: Without dead ends: 47 [2024-10-23 22:34:23,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 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-10-23 22:34:23,424 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:23,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 232 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 22:34:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-23 22:34:23,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-10-23 22:34:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 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), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-23 22:34:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-23 22:34:23,433 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 53 [2024-10-23 22:34:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:23,439 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-23 22:34:23,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-10-23 22:34:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-23 22:34:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-23 22:34:23,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:23,440 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:23,446 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-10-23 22:34:23,640 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-10-23 22:34:23,641 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:23,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:23,641 INFO L85 PathProgramCache]: Analyzing trace with hash -145653805, now seen corresponding path program 1 times [2024-10-23 22:34:23,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:23,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178325552] [2024-10-23 22:34:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:23,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:23,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:23,648 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-10-23 22:34:23,649 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-10-23 22:34:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:23,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-23 22:34:23,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-23 22:34:23,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:23,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:23,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178325552] [2024-10-23 22:34:23,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178325552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:23,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:23,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-23 22:34:23,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778115184] [2024-10-23 22:34:23,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:23,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 22:34:23,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:23,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 22:34:23,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-23 22:34:23,879 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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-10-23 22:34:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:24,257 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-10-23 22:34:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:24,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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 54 [2024-10-23 22:34:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:24,258 INFO L225 Difference]: With dead ends: 65 [2024-10-23 22:34:24,258 INFO L226 Difference]: Without dead ends: 49 [2024-10-23 22:34:24,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 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-10-23 22:34:24,259 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:24,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 239 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 22:34:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-23 22:34:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-10-23 22:34:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 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), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-23 22:34:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-23 22:34:24,262 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 54 [2024-10-23 22:34:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:24,262 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-23 22:34:24,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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-10-23 22:34:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-23 22:34:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-23 22:34:24,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:24,266 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:24,270 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 (25)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:24,467 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-10-23 22:34:24,467 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:24,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash 480693464, now seen corresponding path program 1 times [2024-10-23 22:34:24,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:24,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855261695] [2024-10-23 22:34:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:24,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:24,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:24,470 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-10-23 22:34:24,471 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-10-23 22:34:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:24,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-23 22:34:24,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-23 22:34:24,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:24,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:24,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855261695] [2024-10-23 22:34:24,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855261695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:24,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:24,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-23 22:34:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060183767] [2024-10-23 22:34:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:24,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 22:34:24,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:24,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 22:34:24,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-23 22:34:24,674 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-10-23 22:34:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:25,058 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-10-23 22:34:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:25,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 55 [2024-10-23 22:34:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:25,059 INFO L225 Difference]: With dead ends: 65 [2024-10-23 22:34:25,059 INFO L226 Difference]: Without dead ends: 49 [2024-10-23 22:34:25,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 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-10-23 22:34:25,060 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:25,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 239 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 22:34:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-23 22:34:25,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-10-23 22:34:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 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), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-23 22:34:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-23 22:34:25,064 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 55 [2024-10-23 22:34:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:25,064 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-23 22:34:25,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-10-23 22:34:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-23 22:34:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-23 22:34:25,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:25,065 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:25,069 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 (26)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:25,265 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-10-23 22:34:25,265 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:25,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1139668241, now seen corresponding path program 1 times [2024-10-23 22:34:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943146241] [2024-10-23 22:34:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:25,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:25,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:25,268 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-10-23 22:34:25,269 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-10-23 22:34:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:25,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-23 22:34:25,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-23 22:34:25,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:25,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943146241] [2024-10-23 22:34:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943146241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-23 22:34:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089027924] [2024-10-23 22:34:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:25,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 22:34:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 22:34:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-23 22:34:25,484 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-10-23 22:34:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:25,860 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-10-23 22:34:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:25,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 56 [2024-10-23 22:34:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:25,865 INFO L225 Difference]: With dead ends: 62 [2024-10-23 22:34:25,865 INFO L226 Difference]: Without dead ends: 46 [2024-10-23 22:34:25,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 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-10-23 22:34:25,869 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:25,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 231 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 22:34:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-23 22:34:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-10-23 22:34:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 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-10-23 22:34:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-10-23 22:34:25,873 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 56 [2024-10-23 22:34:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:25,876 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-10-23 22:34:25,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-10-23 22:34:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-10-23 22:34:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-23 22:34:25,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:25,877 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:25,885 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-10-23 22:34:26,077 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-10-23 22:34:26,078 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:26,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1488780788, now seen corresponding path program 1 times [2024-10-23 22:34:26,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:26,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261741213] [2024-10-23 22:34:26,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:26,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:26,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:26,082 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-10-23 22:34:26,082 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-10-23 22:34:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:26,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-23 22:34:26,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:26,163 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-10-23 22:34:26,169 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-10-23 22:34:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-23 22:34:26,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-23 22:34:26,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261741213] [2024-10-23 22:34:26,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261741213] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:26,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:26,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-23 22:34:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719814931] [2024-10-23 22:34:26,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:26,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-23 22:34:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-23 22:34:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-23 22:34:26,603 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 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-10-23 22:34:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:27,096 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-10-23 22:34:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:27,096 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 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 56 [2024-10-23 22:34:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:27,097 INFO L225 Difference]: With dead ends: 62 [2024-10-23 22:34:27,097 INFO L226 Difference]: Without dead ends: 49 [2024-10-23 22:34:27,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 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-10-23 22:34:27,098 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:27,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 277 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 22:34:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-23 22:34:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-10-23 22:34:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 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-10-23 22:34:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-10-23 22:34:27,141 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 56 [2024-10-23 22:34:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:27,142 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-10-23 22:34:27,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 15 states have internal predecessors, (50), 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-10-23 22:34:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-10-23 22:34:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-23 22:34:27,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:27,142 INFO L215 NwaCegarLoop]: trace histogram [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-10-23 22:34:27,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-10-23 22:34:27,343 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-10-23 22:34:27,343 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1117242766, now seen corresponding path program 1 times [2024-10-23 22:34:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285094034] [2024-10-23 22:34:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:27,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:27,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:27,345 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-10-23 22:34:27,347 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-10-23 22:34:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:27,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:27,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-23 22:34:27,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:27,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:27,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285094034] [2024-10-23 22:34:27,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285094034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:27,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:27,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343115462] [2024-10-23 22:34:27,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:27,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:27,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:27,416 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-10-23 22:34:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:27,463 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-10-23 22:34:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:27,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 56 [2024-10-23 22:34:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:27,465 INFO L225 Difference]: With dead ends: 63 [2024-10-23 22:34:27,465 INFO L226 Difference]: Without dead ends: 43 [2024-10-23 22:34:27,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:27,465 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:27,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 22:34:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-23 22:34:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-23 22:34:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 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-10-23 22:34:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-23 22:34:27,468 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 56 [2024-10-23 22:34:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:27,468 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-23 22:34:27,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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-10-23 22:34:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-23 22:34:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-23 22:34:27,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:27,469 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 22:34:27,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 (29)] Ended with exit code 0 [2024-10-23 22:34:27,669 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-10-23 22:34:27,670 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1847352557, now seen corresponding path program 1 times [2024-10-23 22:34:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234660073] [2024-10-23 22:34:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:27,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-10-23 22:34:27,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:27,671 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-10-23 22:34:27,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 (30)] Waiting until timeout for monitored process [2024-10-23 22:34:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:27,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:27,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-23 22:34:27,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-23 22:34:27,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:27,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234660073] [2024-10-23 22:34:27,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234660073] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:27,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:27,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-23 22:34:27,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207078527] [2024-10-23 22:34:27,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:27,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-23 22:34:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-23 22:34:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-23 22:34:27,982 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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-10-23 22:34:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:28,101 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-23 22:34:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-23 22:34:28,102 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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 57 [2024-10-23 22:34:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:28,102 INFO L225 Difference]: With dead ends: 44 [2024-10-23 22:34:28,102 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 22:34:28,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 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-10-23 22:34:28,103 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:28,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 236 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 22:34:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 22:34:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 22:34:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 22:34:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 22:34:28,104 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2024-10-23 22:34:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:28,104 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 22:34:28,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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-10-23 22:34:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 22:34:28,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 22:34:28,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-23 22:34:28,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-23 22:34:28,112 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 (30)] Ended with exit code 0 [2024-10-23 22:34:28,307 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-10-23 22:34:28,310 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-10-23 22:34:28,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 22:34:29,314 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 22:34:29,324 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-23 22:34:29,325 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-23 22:34:29,342 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-23 22:34:29,343 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-23 22:34:29,344 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-23 22:34:29,345 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:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) 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-10-23 22:34:29,348 INFO L158 Benchmark]: Toolchain (without parser) took 28294.03ms. Allocated memory was 100.7MB in the beginning and 207.6MB in the end (delta: 107.0MB). Free memory was 64.7MB in the beginning and 113.5MB in the end (delta: -48.8MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2024-10-23 22:34:29,348 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 50.3MB. Free memory is still 23.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:34:29,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.29ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 50.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 22:34:29,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.58ms. Allocated memory is still 100.7MB. Free memory was 50.8MB in the beginning and 78.6MB in the end (delta: -27.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-23 22:34:29,349 INFO L158 Benchmark]: Boogie Preprocessor took 73.89ms. Allocated memory is still 100.7MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:34:29,349 INFO L158 Benchmark]: RCFGBuilder took 354.03ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 59.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 22:34:29,349 INFO L158 Benchmark]: TraceAbstraction took 27545.13ms. Allocated memory was 100.7MB in the beginning and 207.6MB in the end (delta: 107.0MB). Free memory was 58.4MB in the beginning and 113.5MB in the end (delta: -55.1MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-10-23 22:34:29,350 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.39ms. Allocated memory is still 50.3MB. Free memory is still 23.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.29ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 50.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.58ms. Allocated memory is still 100.7MB. Free memory was 50.8MB in the beginning and 78.6MB in the end (delta: -27.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.89ms. Allocated memory is still 100.7MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 354.03ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 59.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27545.13ms. Allocated memory was 100.7MB in the beginning and 207.6MB in the end (delta: 107.0MB). Free memory was 58.4MB in the beginning and 113.5MB in the end (delta: -55.1MB). Peak memory consumption was 100.7MB. 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: 76]: 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: 82]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 26.5s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 464 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 7962 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6518 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4190 IncrementalHoareTripleChecker+Invalid, 4290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 1444 mSDtfsCounter, 4190 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1704 GetRequests, 1435 SyntacticMatches, 4 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=11, 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, 114 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 1217 NumberOfCodeBlocks, 1217 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1575 ConstructedInterpolants, 12 QuantifiedInterpolants, 5369 SizeOfPredicates, 47 NumberOfNonLiveVariables, 2845 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 687/756 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]: Loop Invariant Derived loop 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-10-23 22:34:29,386 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.