./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_1231.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_1231.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 7acfe881669b731d03fc8aee9db955b71d947923db9c9de4e28fcb386b44b191 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 22:33:49,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:33:49,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 22:33:49,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:33:49,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:33:49,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:33:49,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:33:49,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:33:49,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:33:49,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:33:49,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:33:49,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:33:49,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:33:49,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:33:49,255 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:33:49,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:33:49,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:33:49,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:33:49,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 22:33:49,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:33:49,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:33:49,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:33:49,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:33:49,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:33:49,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:33:49,261 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:33:49,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:33:49,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:33:49,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:33:49,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:33:49,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:33:49,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:33:49,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:49,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:33:49,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:33:49,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:33:49,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 22:33:49,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 22:33:49,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:33:49,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:33:49,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:33:49,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:33:49,266 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 -> 7acfe881669b731d03fc8aee9db955b71d947923db9c9de4e28fcb386b44b191 [2024-10-23 22:33:49,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:33:49,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:33:49,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:33:49,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:33:49,580 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:33:49,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2024-10-23 22:33:51,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:33:51,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:33:51,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2024-10-23 22:33:51,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9022d43f/f6faf28cfcfd4265bf89c3eeee5f6036/FLAG1573af111 [2024-10-23 22:33:51,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9022d43f/f6faf28cfcfd4265bf89c3eeee5f6036 [2024-10-23 22:33:51,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:33:51,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:33:51,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:51,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:33:51,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:33:51,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:51" (1/1) ... [2024-10-23 22:33:51,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad3c66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:51, skipping insertion in model container [2024-10-23 22:33:51,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:51" (1/1) ... [2024-10-23 22:33:51,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:33:51,933 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_1231.c[1835,1848] [2024-10-23 22:33:51,938 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_1231.c[1994,2007] [2024-10-23 22:33:51,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:51,950 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 22:33:51,982 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_1231.c[1835,1848] [2024-10-23 22:33:51,986 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_1231.c[1994,2007] [2024-10-23 22:33:51,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:52,012 INFO L204 MainTranslator]: Completed translation [2024-10-23 22:33:52,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52 WrapperNode [2024-10-23 22:33:52,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:52,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 22:33:52,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 22:33:52,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 22:33:52,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,064 INFO L138 Inliner]: procedures = 19, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-10-23 22:33:52,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 22:33:52,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 22:33:52,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 22:33:52,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 22:33:52,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,107 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:52,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 22:33:52,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 22:33:52,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 22:33:52,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 22:33:52,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (1/1) ... [2024-10-23 22:33:52,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:52,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 22:33:52,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 22:33:52,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 22:33:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 22:33:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 22:33:52,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 22:33:52,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 22:33:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-23 22:33:52,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-23 22:33:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-10-23 22:33:52,231 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-10-23 22:33:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-23 22:33:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-23 22:33:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 22:33:52,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 22:33:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 22:33:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 22:33:52,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 22:33:52,335 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 22:33:52,337 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 22:33:52,582 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-23 22:33:52,582 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 22:33:52,605 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 22:33:52,606 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-23 22:33:52,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:52 BoogieIcfgContainer [2024-10-23 22:33:52,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 22:33:52,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 22:33:52,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 22:33:52,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 22:33:52,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:33:51" (1/3) ... [2024-10-23 22:33:52,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb940cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:33:52, skipping insertion in model container [2024-10-23 22:33:52,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:52" (2/3) ... [2024-10-23 22:33:52,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb940cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:33:52, skipping insertion in model container [2024-10-23 22:33:52,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:52" (3/3) ... [2024-10-23 22:33:52,619 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2024-10-23 22:33:52,637 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 22:33:52,638 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-23 22:33:52,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 22:33:52,726 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;@4a5b32c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 22:33:52,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-23 22:33:52,730 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:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-23 22:33:52,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:52,739 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:52,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:52,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash -234746944, now seen corresponding path program 1 times [2024-10-23 22:33:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285832721] [2024-10-23 22:33:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-23 22:33:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-23 22:33:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,119 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:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:53,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285832721] [2024-10-23 22:33:53,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285832721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:53,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:53,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515397974] [2024-10-23 22:33:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:53,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:53,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:53,162 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:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:53,311 INFO L93 Difference]: Finished difference Result 92 states and 134 transitions. [2024-10-23 22:33:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:53,315 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:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:53,323 INFO L225 Difference]: With dead ends: 92 [2024-10-23 22:33:53,324 INFO L226 Difference]: Without dead ends: 51 [2024-10-23 22:33:53,326 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:53,330 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:53,331 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:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-23 22:33:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-23 22:33:53,366 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:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-10-23 22:33:53,369 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 25 [2024-10-23 22:33:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:53,370 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-10-23 22:33:53,370 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:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-10-23 22:33:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-23 22:33:53,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:53,373 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:53,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 22:33:53,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:53,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash -317048565, now seen corresponding path program 1 times [2024-10-23 22:33:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:53,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489852141] [2024-10-23 22:33:53,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:53,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-23 22:33:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,652 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:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:53,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489852141] [2024-10-23 22:33:53,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489852141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:53,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:53,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:53,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730279307] [2024-10-23 22:33:53,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:53,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:53,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:53,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:53,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:53,660 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:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:53,781 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2024-10-23 22:33:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:53,782 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:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:53,784 INFO L225 Difference]: With dead ends: 74 [2024-10-23 22:33:53,784 INFO L226 Difference]: Without dead ends: 55 [2024-10-23 22:33:53,785 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:53,786 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:53,787 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:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-23 22:33:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-23 22:33:53,796 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:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-23 22:33:53,798 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 30 [2024-10-23 22:33:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:53,798 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-23 22:33:53,799 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:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-23 22:33:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-23 22:33:53,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:53,800 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:53,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 22:33:53,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:53,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1383658216, now seen corresponding path program 1 times [2024-10-23 22:33:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:53,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855940064] [2024-10-23 22:33:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-23 22:33:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,003 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:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855940064] [2024-10-23 22:33:54,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855940064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:54,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:54,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961227855] [2024-10-23 22:33:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:54,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:54,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:54,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:54,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:54,011 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:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:54,110 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-10-23 22:33:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:54,110 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:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:54,111 INFO L225 Difference]: With dead ends: 78 [2024-10-23 22:33:54,112 INFO L226 Difference]: Without dead ends: 59 [2024-10-23 22:33:54,112 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:54,113 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:54,113 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:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-23 22:33:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-10-23 22:33:54,126 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:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-23 22:33:54,129 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 31 [2024-10-23 22:33:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:54,130 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-23 22:33:54,130 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:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-23 22:33:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-23 22:33:54,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:54,133 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:54,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 22:33:54,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:54,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1392348847, now seen corresponding path program 1 times [2024-10-23 22:33:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:54,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187488474] [2024-10-23 22:33:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-23 22:33:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,302 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:54,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187488474] [2024-10-23 22:33:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187488474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:54,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:54,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317681630] [2024-10-23 22:33:54,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:54,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:54,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:54,311 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:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:54,403 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-10-23 22:33:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:54,404 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:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:54,405 INFO L225 Difference]: With dead ends: 78 [2024-10-23 22:33:54,406 INFO L226 Difference]: Without dead ends: 59 [2024-10-23 22:33:54,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:54,407 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:54,407 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:54,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-23 22:33:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-10-23 22:33:54,421 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:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-23 22:33:54,426 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 32 [2024-10-23 22:33:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:54,427 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-23 22:33:54,427 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:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-23 22:33:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-23 22:33:54,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:54,428 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:54,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 22:33:54,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 488146380, now seen corresponding path program 1 times [2024-10-23 22:33:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:54,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381358952] [2024-10-23 22:33:54,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-23 22:33:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,561 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:54,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:54,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381358952] [2024-10-23 22:33:54,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381358952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:54,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:54,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:33:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766134343] [2024-10-23 22:33:54,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:54,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 22:33:54,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:54,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 22:33:54,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 22:33:54,565 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:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:54,656 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-10-23 22:33:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 22:33:54,658 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:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:54,659 INFO L225 Difference]: With dead ends: 78 [2024-10-23 22:33:54,659 INFO L226 Difference]: Without dead ends: 59 [2024-10-23 22:33:54,660 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:54,660 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:54,661 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:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-23 22:33:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-10-23 22:33:54,670 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:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-23 22:33:54,673 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 33 [2024-10-23 22:33:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:54,673 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-23 22:33:54,673 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:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2024-10-23 22:33:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-23 22:33:54,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:54,675 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:54,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 22:33:54,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:54,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash 194743373, now seen corresponding path program 1 times [2024-10-23 22:33:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:54,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160303855] [2024-10-23 22:33:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 22:33:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-23 22:33:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-23 22:33:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-23 22:33:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:33:54,768 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:54,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 22:33:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160303855] [2024-10-23 22:33:54,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160303855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:33:54,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:33:54,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:33:54,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985360693] [2024-10-23 22:33:54,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:33:54,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:33:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 22:33:54,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:33:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:33:54,770 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:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:33:54,885 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-10-23 22:33:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:33:54,886 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:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:33:54,887 INFO L225 Difference]: With dead ends: 58 [2024-10-23 22:33:54,887 INFO L226 Difference]: Without dead ends: 56 [2024-10-23 22:33:54,887 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:54,888 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:54,888 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:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-23 22:33:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-23 22:33:54,900 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:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2024-10-23 22:33:54,901 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 33 [2024-10-23 22:33:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:33:54,902 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2024-10-23 22:33:54,902 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:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2024-10-23 22:33:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-23 22:33:54,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:33:54,903 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:54,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 22:33:54,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:33:54,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:33:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash 750140511, now seen corresponding path program 1 times [2024-10-23 22:33:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 22:33:54,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465048123] [2024-10-23 22:33:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:33:54,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 22:33:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:33:54,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-23 22:33:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-23 22:33:54,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-23 22:33:54,983 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-23 22:33:54,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-23 22:33:54,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-23 22:33:54,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 22:33:54,988 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:33:55,017 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 22:33:55,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:33:55 BoogieIcfgContainer [2024-10-23 22:33:55,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 22:33:55,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 22:33:55,022 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 22:33:55,022 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 22:33:55,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:33:52" (3/4) ... [2024-10-23 22:33:55,024 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-23 22:33:55,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 22:33:55,026 INFO L158 Benchmark]: Toolchain (without parser) took 3336.74ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 104.4MB in the beginning and 181.3MB in the end (delta: -76.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:55,026 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:55,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.82ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 90.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 22:33:55,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.43ms. Allocated memory is still 159.4MB. Free memory was 90.4MB in the beginning and 88.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:33:55,027 INFO L158 Benchmark]: Boogie Preprocessor took 72.17ms. Allocated memory is still 159.4MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:33:55,027 INFO L158 Benchmark]: RCFGBuilder took 467.42ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 69.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 22:33:55,029 INFO L158 Benchmark]: TraceAbstraction took 2410.06ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 68.8MB in the beginning and 181.3MB in the end (delta: -112.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:55,029 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 228.6MB. Free memory is still 181.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:33:55,030 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.11ms. Allocated memory is still 159.4MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.82ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 90.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.43ms. Allocated memory is still 159.4MB. Free memory was 90.4MB in the beginning and 88.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.17ms. Allocated memory is still 159.4MB. Free memory was 88.8MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 467.42ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 69.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2410.06ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 68.8MB in the beginning and 181.3MB in the end (delta: -112.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 228.6MB. Free memory is still 181.3MB. 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: 77]: 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 76. Possible FailurePath: [L68] float x = __VERIFIER_nondet_float(); [L69] float y = __VERIFIER_nondet_float(); [L70] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578698] [L59] return x != x; [L70] RET, EXPR isnan_float(x) VAL [x=4286578698] [L70] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578698] [L70] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578699] [L59] return x != x; [L70] RET, EXPR isnan_float(y) VAL [x=4286578698, y=4286578699] [L70] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578698, y=4286578699] [L70-L71] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [x=4286578698, y=4286578699] [L70-L71] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L73] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578698] [L15] __uint32_t w; VAL [\old(x)=4286578698, x=4286578698] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578698, w=4286578689, x=4286578698] [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; VAL [\old(x)=4286578698, \result=0, x=4286578698] [L38] RET, EXPR __fpclassify_float(x) VAL [x=4286578698, y=4286578699] [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; VAL [\result=4286578699, x=4286578698] [L73] RET, EXPR fmin_float(x, y) [L73] float res = fmin_float(x, y); [L76] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578698] [L59] return x != x; [L76] RET, EXPR isnan_float(x) VAL [x=4286578698, y=4286578699] [L76] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578698, y=4286578699] [L76] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578699] [L59] return x != x; [L76] RET, EXPR isnan_float(y) VAL [x=4286578698, y=4286578699] [L76] EXPR isnan_float(x) && !isnan_float(y) VAL [x=4286578698, y=4286578699] [L76] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L77] reach_error() VAL [x=4286578698, y=4286578699] - UnprovableResult [Line: 83]: 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: 2.3s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 1240 SdHoareTripleChecker+Invalid, 0.4s 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.2s 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s 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:55,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.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 7acfe881669b731d03fc8aee9db955b71d947923db9c9de4e28fcb386b44b191 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 22:33:57,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:33:57,337 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:57,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:33:57,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:33:57,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:33:57,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:33:57,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:33:57,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:33:57,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:33:57,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:33:57,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:33:57,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:33:57,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:33:57,393 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:33:57,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:33:57,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:33:57,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:33:57,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:33:57,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:33:57,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:33:57,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:33:57,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:33:57,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-23 22:33:57,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-23 22:33:57,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:33:57,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-23 22:33:57,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:33:57,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:33:57,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:33:57,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:33:57,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:33:57,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:33:57,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:33:57,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:33:57,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:33:57,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:33:57,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:33:57,403 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-23 22:33:57,404 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-23 22:33:57,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:33:57,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:33:57,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:33:57,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:33:57,405 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-23 22:33:57,406 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 -> 7acfe881669b731d03fc8aee9db955b71d947923db9c9de4e28fcb386b44b191 [2024-10-23 22:33:57,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:33:57,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:33:57,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:33:57,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:33:57,783 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:33:57,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2024-10-23 22:33:59,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:33:59,611 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:33:59,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2024-10-23 22:33:59,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55ff2803f/c5255cf7014848dfa3e01132a22f52ea/FLAG2a0f241a9 [2024-10-23 22:33:59,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55ff2803f/c5255cf7014848dfa3e01132a22f52ea [2024-10-23 22:33:59,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:33:59,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:33:59,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:59,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:33:59,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:33:59,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d9ed93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59, skipping insertion in model container [2024-10-23 22:33:59,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:33:59,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:33:59,894 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_1231.c[1835,1848] [2024-10-23 22:33:59,900 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_1231.c[1994,2007] [2024-10-23 22:33:59,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:59,919 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 22:33:59,950 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_1231.c[1835,1848] [2024-10-23 22:33:59,951 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_1231.c[1994,2007] [2024-10-23 22:33:59,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:33:59,988 INFO L204 MainTranslator]: Completed translation [2024-10-23 22:33:59,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59 WrapperNode [2024-10-23 22:33:59,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 22:33:59,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 22:33:59,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 22:33:59,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 22:34:00,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,040 INFO L138 Inliner]: procedures = 22, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-10-23 22:34:00,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 22:34:00,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 22:34:00,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 22:34:00,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 22:34:00,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,084 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:00,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,113 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 22:34:00,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 22:34:00,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 22:34:00,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 22:34:00,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (1/1) ... [2024-10-23 22:34:00,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:34:00,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 22:34:00,156 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:00,163 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:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 22:34:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-23 22:34:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-23 22:34:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 22:34:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-10-23 22:34:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-10-23 22:34:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2024-10-23 22:34:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2024-10-23 22:34:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-23 22:34:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-23 22:34:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 22:34:00,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 22:34:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-23 22:34:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-23 22:34:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 22:34:00,319 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 22:34:00,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 22:34:00,628 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-23 22:34:00,628 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 22:34:00,660 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 22:34:00,661 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-23 22:34:00,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:34:00 BoogieIcfgContainer [2024-10-23 22:34:00,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 22:34:00,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 22:34:00,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 22:34:00,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 22:34:00,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:33:59" (1/3) ... [2024-10-23 22:34:00,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da03e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:34:00, skipping insertion in model container [2024-10-23 22:34:00,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:33:59" (2/3) ... [2024-10-23 22:34:00,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da03e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:34:00, skipping insertion in model container [2024-10-23 22:34:00,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:34:00" (3/3) ... [2024-10-23 22:34:00,672 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2024-10-23 22:34:00,691 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 22:34:00,691 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-23 22:34:00,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 22:34:00,773 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;@47cdec75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 22:34:00,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-23 22:34:00,778 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:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-23 22:34:00,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:00,788 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:00,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:00,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash -338858700, now seen corresponding path program 1 times [2024-10-23 22:34:00,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358035388] [2024-10-23 22:34:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:00,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:00,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:00,811 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:00,812 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:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:00,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-23 22:34:00,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:00,967 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:00,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:00,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358035388] [2024-10-23 22:34:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358035388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:00,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:00,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 22:34:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835899685] [2024-10-23 22:34:00,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:00,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 22:34:00,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:01,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 22:34:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 22:34:01,008 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:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:01,041 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2024-10-23 22:34:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 22:34:01,044 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:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:01,052 INFO L225 Difference]: With dead ends: 84 [2024-10-23 22:34:01,052 INFO L226 Difference]: Without dead ends: 47 [2024-10-23 22:34:01,055 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:01,059 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:01,060 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:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-23 22:34:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-23 22:34:01,092 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:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-10-23 22:34:01,096 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 24 [2024-10-23 22:34:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:01,098 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-10-23 22:34:01,098 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:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-10-23 22:34:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-23 22:34:01,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:01,100 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:01,107 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:01,303 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:01,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:01,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash -43049946, now seen corresponding path program 1 times [2024-10-23 22:34:01,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:01,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565502090] [2024-10-23 22:34:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:01,309 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,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:01,312 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:01,315 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:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:01,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:01,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:01,452 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:01,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:01,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:01,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565502090] [2024-10-23 22:34:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565502090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:01,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:01,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:01,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804366378] [2024-10-23 22:34:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:01,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:01,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:01,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:01,459 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:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:01,518 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-10-23 22:34:01,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:01,519 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:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:01,520 INFO L225 Difference]: With dead ends: 82 [2024-10-23 22:34:01,521 INFO L226 Difference]: Without dead ends: 49 [2024-10-23 22:34:01,522 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:01,525 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:01,526 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:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-23 22:34:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-23 22:34:01,536 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:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-10-23 22:34:01,538 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 25 [2024-10-23 22:34:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:01,539 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-10-23 22:34:01,539 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:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2024-10-23 22:34:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-23 22:34:01,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:01,541 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:01,545 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:01,741 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:01,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:01,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1978510601, now seen corresponding path program 1 times [2024-10-23 22:34:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:01,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665392368] [2024-10-23 22:34:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:01,745 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,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:01,746 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:01,748 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:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:01,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:01,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:01,860 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:01,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:01,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665392368] [2024-10-23 22:34:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665392368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:01,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:01,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258080140] [2024-10-23 22:34:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:01,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:01,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:01,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:01,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:01,863 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:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:01,915 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2024-10-23 22:34:01,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:01,920 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:01,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:01,922 INFO L225 Difference]: With dead ends: 71 [2024-10-23 22:34:01,922 INFO L226 Difference]: Without dead ends: 52 [2024-10-23 22:34:01,923 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:01,928 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:01,929 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:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-23 22:34:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-23 22:34:01,943 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:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-23 22:34:01,944 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 29 [2024-10-23 22:34:01,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:01,945 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-23 22:34:01,945 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:01,945 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-23 22:34:01,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-23 22:34:01,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:01,947 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:01,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:02,147 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:02,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:02,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2001085390, now seen corresponding path program 1 times [2024-10-23 22:34:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:02,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195843108] [2024-10-23 22:34:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:02,149 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,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:02,150 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:02,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-23 22:34:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:02,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:02,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:02,237 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,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:02,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195843108] [2024-10-23 22:34:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195843108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:02,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:02,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761547468] [2024-10-23 22:34:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:02,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:02,240 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:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:02,277 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-10-23 22:34:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:02,278 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:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:02,279 INFO L225 Difference]: With dead ends: 74 [2024-10-23 22:34:02,279 INFO L226 Difference]: Without dead ends: 55 [2024-10-23 22:34:02,280 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:02,281 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:02,281 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:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-23 22:34:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-23 22:34:02,300 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,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-23 22:34:02,301 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 30 [2024-10-23 22:34:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:02,301 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-23 22:34:02,301 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:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-23 22:34:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-23 22:34:02,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:02,304 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:02,310 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:02,508 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:02,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:02,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1077732571, now seen corresponding path program 1 times [2024-10-23 22:34:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761988627] [2024-10-23 22:34:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:02,510 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,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:02,513 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:02,515 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:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:02,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:02,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:02,609 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,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:02,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:02,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761988627] [2024-10-23 22:34:02,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761988627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:02,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:02,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:02,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375667652] [2024-10-23 22:34:02,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:02,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:02,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:02,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:02,616 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:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:02,675 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-10-23 22:34:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:02,676 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:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:02,678 INFO L225 Difference]: With dead ends: 74 [2024-10-23 22:34:02,679 INFO L226 Difference]: Without dead ends: 55 [2024-10-23 22:34:02,680 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:02,680 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:02,684 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:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-23 22:34:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-23 22:34:02,697 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,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-23 22:34:02,701 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 31 [2024-10-23 22:34:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:02,701 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-23 22:34:02,702 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:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-23 22:34:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-23 22:34:02,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:02,703 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:02,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:02,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:02,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:02,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1515477974, now seen corresponding path program 1 times [2024-10-23 22:34:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:02,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467642939] [2024-10-23 22:34:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:02,907 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,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:02,909 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:34:02,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-23 22:34:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:02,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:02,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:03,009 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,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:03,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467642939] [2024-10-23 22:34:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467642939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:03,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299234917] [2024-10-23 22:34:03,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:03,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:03,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:03,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:03,012 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,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:03,054 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2024-10-23 22:34:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:03,057 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,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:03,058 INFO L225 Difference]: With dead ends: 74 [2024-10-23 22:34:03,058 INFO L226 Difference]: Without dead ends: 55 [2024-10-23 22:34:03,059 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,062 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,062 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,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-23 22:34:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-10-23 22:34:03,072 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,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-23 22:34:03,072 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 32 [2024-10-23 22:34:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:03,073 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-23 22:34:03,073 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,073 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-23 22:34:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-23 22:34:03,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:03,076 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,081 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:03,276 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:03,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:03,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:03,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1386395255, now seen corresponding path program 1 times [2024-10-23 22:34:03,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:03,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66397412] [2024-10-23 22:34:03,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:03,278 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,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:03,279 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:03,280 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:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:03,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:03,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:03,585 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:03,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:03,777 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:03,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66397412] [2024-10-23 22:34:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66397412] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:03,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-10-23 22:34:03,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049981415] [2024-10-23 22:34:03,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:03,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-23 22:34:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:03,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-23 22:34:03,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-23 22:34:03,779 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,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:04,205 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2024-10-23 22:34:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-23 22:34:04,209 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:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:04,211 INFO L225 Difference]: With dead ends: 93 [2024-10-23 22:34:04,211 INFO L226 Difference]: Without dead ends: 80 [2024-10-23 22:34:04,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 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:04,212 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 39 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:04,212 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.4s Time] [2024-10-23 22:34:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-23 22:34:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2024-10-23 22:34:04,229 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:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2024-10-23 22:34:04,233 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 32 [2024-10-23 22:34:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:04,233 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2024-10-23 22:34:04,234 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:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2024-10-23 22:34:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-23 22:34:04,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:04,238 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:04,243 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:04,438 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:04,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:04,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1403277256, now seen corresponding path program 1 times [2024-10-23 22:34:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:04,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186339438] [2024-10-23 22:34:04,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:04,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:34:04,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:04,443 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:04,444 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:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:04,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:04,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:04,688 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:04,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:04,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186339438] [2024-10-23 22:34:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186339438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:04,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:04,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-23 22:34:04,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29601339] [2024-10-23 22:34:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-23 22:34:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-23 22:34:04,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-23 22:34:04,691 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:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:04,920 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2024-10-23 22:34:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-23 22:34:04,921 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:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:04,922 INFO L225 Difference]: With dead ends: 116 [2024-10-23 22:34:04,922 INFO L226 Difference]: Without dead ends: 79 [2024-10-23 22:34:04,923 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:04,924 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 22 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:04,924 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:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-23 22:34:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2024-10-23 22:34:04,930 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:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-10-23 22:34:04,931 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 34 [2024-10-23 22:34:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:04,931 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-10-23 22:34:04,932 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:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-10-23 22:34:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-23 22:34:04,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:04,933 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:04,938 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,136 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,137 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:05,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:05,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1889405723, now seen corresponding path program 1 times [2024-10-23 22:34:05,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:05,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456108650] [2024-10-23 22:34:05,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:05,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:05,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:05,139 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,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 (10)] Waiting until timeout for monitored process [2024-10-23 22:34:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:05,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-23 22:34:05,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:05,400 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:05,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:05,603 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:05,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:05,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456108650] [2024-10-23 22:34:05,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456108650] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:05,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:05,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-10-23 22:34:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300255038] [2024-10-23 22:34:05,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:05,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-23 22:34:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:05,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-23 22:34:05,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-10-23 22:34:05,607 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,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:06,014 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2024-10-23 22:34:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-23 22:34:06,015 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,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:06,017 INFO L225 Difference]: With dead ends: 106 [2024-10-23 22:34:06,017 INFO L226 Difference]: Without dead ends: 104 [2024-10-23 22:34:06,017 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,018 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 78 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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,018 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,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-23 22:34:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 78. [2024-10-23 22:34:06,026 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,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-10-23 22:34:06,028 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 36 [2024-10-23 22:34:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:06,028 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-10-23 22:34:06,028 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,028 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-10-23 22:34:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-23 22:34:06,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:06,030 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,037 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,233 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,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:06,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1007976621, now seen corresponding path program 1 times [2024-10-23 22:34:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:06,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240381415] [2024-10-23 22:34:06,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:06,235 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,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:06,236 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:06,237 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:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:06,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 22:34:06,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:06,311 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:06,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:06,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240381415] [2024-10-23 22:34:06,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240381415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:06,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:06,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:34:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056533991] [2024-10-23 22:34:06,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:06,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:34:06,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:34:06,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:34:06,314 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:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:06,330 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2024-10-23 22:34:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:34:06,330 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:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:06,332 INFO L225 Difference]: With dead ends: 81 [2024-10-23 22:34:06,332 INFO L226 Difference]: Without dead ends: 79 [2024-10-23 22:34:06,332 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:06,333 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:06,333 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:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-23 22:34:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-10-23 22:34:06,340 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,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-10-23 22:34:06,341 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 38 [2024-10-23 22:34:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:06,341 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-10-23 22:34:06,341 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:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-10-23 22:34:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-23 22:34:06,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:06,343 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:06,349 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:06,543 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:06,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:06,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:06,544 INFO L85 PathProgramCache]: Analyzing trace with hash 400442160, now seen corresponding path program 1 times [2024-10-23 22:34:06,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:06,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038529691] [2024-10-23 22:34:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:06,545 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,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:06,546 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:06,547 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:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:06,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:06,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:06,627 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:06,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:06,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038529691] [2024-10-23 22:34:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038529691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:06,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:06,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:06,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718430114] [2024-10-23 22:34:06,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:06,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:06,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:06,630 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:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:06,670 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2024-10-23 22:34:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:06,671 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:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:06,672 INFO L225 Difference]: With dead ends: 106 [2024-10-23 22:34:06,672 INFO L226 Difference]: Without dead ends: 82 [2024-10-23 22:34:06,672 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:06,673 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:06,673 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:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-23 22:34:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-23 22:34:06,686 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:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 119 transitions. [2024-10-23 22:34:06,687 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 119 transitions. Word has length 41 [2024-10-23 22:34:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:06,688 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 119 transitions. [2024-10-23 22:34:06,688 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:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 119 transitions. [2024-10-23 22:34:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-23 22:34:06,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:06,692 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:06,698 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 (12)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:06,895 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:06,895 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:06,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:06,896 INFO L85 PathProgramCache]: Analyzing trace with hash -186363854, now seen corresponding path program 1 times [2024-10-23 22:34:06,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:06,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383398349] [2024-10-23 22:34:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:06,896 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,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:06,897 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:06,898 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:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:06,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-23 22:34:06,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:07,440 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,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:08,376 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,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383398349] [2024-10-23 22:34:08,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383398349] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:08,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:08,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-10-23 22:34:08,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683915674] [2024-10-23 22:34:08,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:08,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-23 22:34:08,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:08,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-23 22:34:08,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2024-10-23 22:34:08,378 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,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:09,921 INFO L93 Difference]: Finished difference Result 144 states and 199 transitions. [2024-10-23 22:34:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-23 22:34:09,922 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,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:09,923 INFO L225 Difference]: With dead ends: 144 [2024-10-23 22:34:09,923 INFO L226 Difference]: Without dead ends: 108 [2024-10-23 22:34:09,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2024-10-23 22:34:09,924 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:09,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 904 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 22:34:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-23 22:34:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2024-10-23 22:34:09,938 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,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2024-10-23 22:34:09,939 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 41 [2024-10-23 22:34:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:09,942 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2024-10-23 22:34:09,943 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,943 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2024-10-23 22:34:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-23 22:34:09,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:09,944 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,951 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:10,144 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:10,145 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:10,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1566041830, now seen corresponding path program 1 times [2024-10-23 22:34:10,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:10,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844771039] [2024-10-23 22:34:10,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:10,147 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,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:10,150 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:10,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-23 22:34:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:10,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:10,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:10,371 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,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:10,689 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,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844771039] [2024-10-23 22:34:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844771039] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:10,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-10-23 22:34:10,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286438121] [2024-10-23 22:34:10,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:10,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-23 22:34:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:10,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-23 22:34:10,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-23 22:34:10,692 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,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:10,981 INFO L93 Difference]: Finished difference Result 101 states and 138 transitions. [2024-10-23 22:34:10,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:10,981 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,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:10,982 INFO L225 Difference]: With dead ends: 101 [2024-10-23 22:34:10,982 INFO L226 Difference]: Without dead ends: 81 [2024-10-23 22:34:10,983 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,983 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.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:10,984 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.3s Time] [2024-10-23 22:34:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-23 22:34:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-23 22:34:10,989 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,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 108 transitions. [2024-10-23 22:34:10,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 108 transitions. Word has length 42 [2024-10-23 22:34:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:10,991 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 108 transitions. [2024-10-23 22:34:10,991 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,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 108 transitions. [2024-10-23 22:34:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-23 22:34:10,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:10,992 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,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-23 22:34:11,195 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:11,196 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:11,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash 888191559, now seen corresponding path program 1 times [2024-10-23 22:34:11,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:11,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781563319] [2024-10-23 22:34:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:11,197 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,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:11,199 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:11,200 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:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:11,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-23 22:34:11,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:11,399 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,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:11,559 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,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781563319] [2024-10-23 22:34:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781563319] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:11,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:11,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2024-10-23 22:34:11,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032545714] [2024-10-23 22:34:11,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:11,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-23 22:34:11,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:11,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-23 22:34:11,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-23 22:34:11,562 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,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:11,903 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2024-10-23 22:34:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:11,904 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,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:11,905 INFO L225 Difference]: With dead ends: 109 [2024-10-23 22:34:11,905 INFO L226 Difference]: Without dead ends: 71 [2024-10-23 22:34:11,905 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,906 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:11,906 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.3s Time] [2024-10-23 22:34:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-23 22:34:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-10-23 22:34:11,911 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,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2024-10-23 22:34:11,912 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 42 [2024-10-23 22:34:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:11,912 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2024-10-23 22:34:11,912 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,913 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-10-23 22:34:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-23 22:34:11,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:11,913 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,918 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:12,117 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:12,117 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:12,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2044179483, now seen corresponding path program 1 times [2024-10-23 22:34:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723856133] [2024-10-23 22:34:12,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:12,118 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,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:12,119 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:12,120 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:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:12,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:12,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:12,316 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:12,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:12,464 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,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:12,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723856133] [2024-10-23 22:34:12,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723856133] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:12,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:12,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-10-23 22:34:12,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247485062] [2024-10-23 22:34:12,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:12,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-23 22:34:12,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:12,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-23 22:34:12,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-23 22:34:12,467 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,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:12,697 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2024-10-23 22:34:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:12,698 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,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:12,699 INFO L225 Difference]: With dead ends: 81 [2024-10-23 22:34:12,699 INFO L226 Difference]: Without dead ends: 66 [2024-10-23 22:34:12,699 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,700 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 20 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:12,700 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.2s Time] [2024-10-23 22:34:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-23 22:34:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-23 22:34:12,704 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,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-10-23 22:34:12,705 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 42 [2024-10-23 22:34:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:12,706 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-10-23 22:34:12,706 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,706 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-10-23 22:34:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-23 22:34:12,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:12,707 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,712 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 (16)] Ended with exit code 0 [2024-10-23 22:34:12,907 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,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:12,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1012738482, now seen corresponding path program 1 times [2024-10-23 22:34:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:12,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22352633] [2024-10-23 22:34:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:12,908 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,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:12,910 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,911 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,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:12,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:12,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:12,994 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,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:12,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22352633] [2024-10-23 22:34:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22352633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:12,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:12,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620565156] [2024-10-23 22:34:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:13,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:13,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:13,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:13,001 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:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:13,062 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2024-10-23 22:34:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:13,063 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:13,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:13,064 INFO L225 Difference]: With dead ends: 93 [2024-10-23 22:34:13,064 INFO L226 Difference]: Without dead ends: 69 [2024-10-23 22:34:13,064 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:13,065 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:13,065 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.1s Time] [2024-10-23 22:34:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-23 22:34:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-10-23 22:34:13,073 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:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2024-10-23 22:34:13,074 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 43 [2024-10-23 22:34:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:13,074 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2024-10-23 22:34:13,074 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:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-10-23 22:34:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-23 22:34:13,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:13,077 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:13,082 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 (17)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:13,280 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:13,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:13,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:13,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1599544496, now seen corresponding path program 1 times [2024-10-23 22:34:13,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:13,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24733911] [2024-10-23 22:34:13,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:13,282 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:13,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:13,285 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:13,287 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:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:13,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-23 22:34:13,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:13,635 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,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:14,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:14,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24733911] [2024-10-23 22:34:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24733911] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 22:34:14,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1677502461] [2024-10-23 22:34:14,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:14,191 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-23 22:34:14,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-23 22:34:14,194 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:14,197 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:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:14,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-23 22:34:14,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:14,589 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:14,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:14,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1677502461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 22:34:14,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:14,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2024-10-23 22:34:14,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10056260] [2024-10-23 22:34:14,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:14,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-23 22:34:14,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:14,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-23 22:34:14,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-10-23 22:34:14,745 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:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:15,128 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-10-23 22:34:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-23 22:34:15,130 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:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:15,131 INFO L225 Difference]: With dead ends: 77 [2024-10-23 22:34:15,131 INFO L226 Difference]: Without dead ends: 67 [2024-10-23 22:34:15,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-10-23 22:34:15,132 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.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:15,132 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.3s Time] [2024-10-23 22:34:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-23 22:34:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-23 22:34:15,138 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:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2024-10-23 22:34:15,141 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 43 [2024-10-23 22:34:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:15,141 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2024-10-23 22:34:15,141 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:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2024-10-23 22:34:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-23 22:34:15,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:15,142 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:15,149 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:15,346 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:15,542 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:15,543 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:15,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash 510962961, now seen corresponding path program 1 times [2024-10-23 22:34:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:15,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136737444] [2024-10-23 22:34:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:15,544 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,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:15,545 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:15,546 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:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:15,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:15,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:15,613 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,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:15,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:15,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136737444] [2024-10-23 22:34:15,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136737444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:15,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:15,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:15,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386832077] [2024-10-23 22:34:15,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:15,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:15,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:15,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:15,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:15,615 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:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:15,642 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2024-10-23 22:34:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:15,643 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:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:15,644 INFO L225 Difference]: With dead ends: 95 [2024-10-23 22:34:15,644 INFO L226 Difference]: Without dead ends: 70 [2024-10-23 22:34:15,644 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:15,645 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:15,645 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:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-23 22:34:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-10-23 22:34:15,651 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:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2024-10-23 22:34:15,652 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 44 [2024-10-23 22:34:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:15,653 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2024-10-23 22:34:15,653 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:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2024-10-23 22:34:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-23 22:34:15,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:15,655 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,660 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,858 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,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1541069270, now seen corresponding path program 1 times [2024-10-23 22:34:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:15,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114051798] [2024-10-23 22:34:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:15,860 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,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:15,863 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,864 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,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:15,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:15,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:15,943 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,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:15,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:15,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114051798] [2024-10-23 22:34:15,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114051798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:15,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:15,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:15,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500404176] [2024-10-23 22:34:15,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:15,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:15,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:15,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:15,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:15,946 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:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:16,077 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2024-10-23 22:34:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:16,078 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:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:16,079 INFO L225 Difference]: With dead ends: 93 [2024-10-23 22:34:16,079 INFO L226 Difference]: Without dead ends: 68 [2024-10-23 22:34:16,080 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:16,080 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:16,080 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:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-23 22:34:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2024-10-23 22:34:16,084 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:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2024-10-23 22:34:16,085 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 45 [2024-10-23 22:34:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:16,085 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2024-10-23 22:34:16,086 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:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2024-10-23 22:34:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-23 22:34:16,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:16,087 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:16,093 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:16,290 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:16,290 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:16,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:16,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2051603447, now seen corresponding path program 1 times [2024-10-23 22:34:16,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:16,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972081353] [2024-10-23 22:34:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:16,291 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,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:16,292 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:16,293 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:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:16,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-23 22:34:16,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:16,485 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:16,488 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:16,814 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:16,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:16,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972081353] [2024-10-23 22:34:16,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972081353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:16,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-23 22:34:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89891285] [2024-10-23 22:34:16,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:16,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-23 22:34:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:16,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-23 22:34:16,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-23 22:34:16,817 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:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:17,373 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2024-10-23 22:34:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-23 22:34:17,374 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:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:17,374 INFO L225 Difference]: With dead ends: 67 [2024-10-23 22:34:17,374 INFO L226 Difference]: Without dead ends: 47 [2024-10-23 22:34:17,375 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:17,375 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:17,375 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:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-23 22:34:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-10-23 22:34:17,378 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:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-10-23 22:34:17,379 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 45 [2024-10-23 22:34:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:17,379 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-10-23 22:34:17,379 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:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2024-10-23 22:34:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-23 22:34:17,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:17,380 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:17,385 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 (22)] Ended with exit code 0 [2024-10-23 22:34:17,584 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:17,584 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:17,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1340619783, now seen corresponding path program 1 times [2024-10-23 22:34:17,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:17,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704846600] [2024-10-23 22:34:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:17,585 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:17,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:17,586 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:17,588 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:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:17,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-23 22:34:17,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:18,020 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:18,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:18,933 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:18,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:18,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704846600] [2024-10-23 22:34:18,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704846600] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:18,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:18,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-10-23 22:34:18,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75612379] [2024-10-23 22:34:18,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:18,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-23 22:34:18,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:18,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-23 22:34:18,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-10-23 22:34:18,936 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:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:19,513 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2024-10-23 22:34:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-23 22:34:19,513 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:19,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:19,514 INFO L225 Difference]: With dead ends: 75 [2024-10-23 22:34:19,514 INFO L226 Difference]: Without dead ends: 45 [2024-10-23 22:34:19,514 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:19,515 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:19,515 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.4s Time] [2024-10-23 22:34:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-23 22:34:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-10-23 22:34:19,518 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:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-10-23 22:34:19,519 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 48 [2024-10-23 22:34:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:19,519 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-10-23 22:34:19,519 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:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-10-23 22:34:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-23 22:34:19,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:19,520 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:19,525 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:19,721 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:19,721 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:19,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash 263903100, now seen corresponding path program 1 times [2024-10-23 22:34:19,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:19,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647513749] [2024-10-23 22:34:19,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:19,722 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:19,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:19,723 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:19,724 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:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:19,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-23 22:34:19,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:19,885 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:19,887 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:19,930 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:19,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:19,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647513749] [2024-10-23 22:34:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647513749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-23 22:34:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067113813] [2024-10-23 22:34:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:19,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 22:34:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:19,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 22:34:19,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-23 22:34:19,932 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:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:20,319 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2024-10-23 22:34:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:20,320 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:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:20,320 INFO L225 Difference]: With dead ends: 63 [2024-10-23 22:34:20,320 INFO L226 Difference]: Without dead ends: 47 [2024-10-23 22:34:20,321 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:20,322 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.4s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:20,323 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.4s Time] [2024-10-23 22:34:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-23 22:34:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-10-23 22:34:20,326 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:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-23 22:34:20,329 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 53 [2024-10-23 22:34:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:20,330 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-23 22:34:20,330 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:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-23 22:34:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-23 22:34:20,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:20,331 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:20,336 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:20,532 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:20,532 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:20,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:20,532 INFO L85 PathProgramCache]: Analyzing trace with hash -145653805, now seen corresponding path program 1 times [2024-10-23 22:34:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:20,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276775923] [2024-10-23 22:34:20,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:20,533 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:20,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:20,534 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:20,535 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:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:20,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-23 22:34:20,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:20,749 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:20,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:20,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276775923] [2024-10-23 22:34:20,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276775923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:20,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-23 22:34:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900919824] [2024-10-23 22:34:20,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:20,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 22:34:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:20,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 22:34:20,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-23 22:34:20,751 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:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:21,314 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-10-23 22:34:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:21,315 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:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:21,315 INFO L225 Difference]: With dead ends: 65 [2024-10-23 22:34:21,316 INFO L226 Difference]: Without dead ends: 49 [2024-10-23 22:34:21,316 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:21,316 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:21,317 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.5s Time] [2024-10-23 22:34:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-23 22:34:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-10-23 22:34:21,320 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:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-23 22:34:21,321 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 54 [2024-10-23 22:34:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:21,321 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-23 22:34:21,321 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:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-23 22:34:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-23 22:34:21,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:21,322 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:21,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-10-23 22:34:21,523 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:21,523 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:21,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:21,523 INFO L85 PathProgramCache]: Analyzing trace with hash 480693464, now seen corresponding path program 1 times [2024-10-23 22:34:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079483519] [2024-10-23 22:34:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:21,525 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:21,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:21,526 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:21,530 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:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:21,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-23 22:34:21,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:21,754 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:21,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:21,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:21,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079483519] [2024-10-23 22:34:21,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079483519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:21,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:21,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-23 22:34:21,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593366796] [2024-10-23 22:34:21,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:21,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 22:34:21,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:21,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 22:34:21,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-23 22:34:21,756 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:22,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:22,203 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-10-23 22:34:22,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:22,203 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:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:22,204 INFO L225 Difference]: With dead ends: 65 [2024-10-23 22:34:22,204 INFO L226 Difference]: Without dead ends: 49 [2024-10-23 22:34:22,205 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:22,205 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:22,205 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.4s Time] [2024-10-23 22:34:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-23 22:34:22,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-10-23 22:34:22,212 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:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-23 22:34:22,212 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 55 [2024-10-23 22:34:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:22,213 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-23 22:34:22,213 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:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-23 22:34:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-23 22:34:22,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:22,214 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:22,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-23 22:34:22,414 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:22,414 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:22,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1139668241, now seen corresponding path program 1 times [2024-10-23 22:34:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:22,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410471131] [2024-10-23 22:34:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:22,415 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,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:22,416 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:22,418 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:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:22,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-23 22:34:22,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:22,610 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:22,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:22,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:22,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410471131] [2024-10-23 22:34:22,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410471131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:22,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:22,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-23 22:34:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146809211] [2024-10-23 22:34:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:22,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 22:34:22,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:22,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 22:34:22,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-23 22:34:22,612 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:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:22,971 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-10-23 22:34:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:22,972 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:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:22,973 INFO L225 Difference]: With dead ends: 62 [2024-10-23 22:34:22,973 INFO L226 Difference]: Without dead ends: 46 [2024-10-23 22:34:22,973 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:22,974 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:22,974 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:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-23 22:34:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-10-23 22:34:22,977 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:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-10-23 22:34:22,978 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 56 [2024-10-23 22:34:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:22,978 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-10-23 22:34:22,978 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:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-10-23 22:34:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-23 22:34:22,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:22,979 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:22,984 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:23,179 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:23,180 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:23,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:23,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1488780788, now seen corresponding path program 1 times [2024-10-23 22:34:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:23,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110341955] [2024-10-23 22:34:23,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:23,181 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,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:23,182 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:23,183 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:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:23,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-23 22:34:23,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:23,263 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,265 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,388 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:23,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:23,679 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:23,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110341955] [2024-10-23 22:34:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110341955] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:23,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-23 22:34:23,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337254503] [2024-10-23 22:34:23,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:23,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-23 22:34:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:23,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-23 22:34:23,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-23 22:34:23,681 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:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:23,965 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-10-23 22:34:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-23 22:34:23,966 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:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:23,967 INFO L225 Difference]: With dead ends: 62 [2024-10-23 22:34:23,967 INFO L226 Difference]: Without dead ends: 49 [2024-10-23 22:34:23,967 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:23,968 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-23 22:34:23,968 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.3s Time] [2024-10-23 22:34:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-23 22:34:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-10-23 22:34:23,975 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:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-10-23 22:34:23,976 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 56 [2024-10-23 22:34:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:23,976 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-10-23 22:34:23,976 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:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-10-23 22:34:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-23 22:34:23,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:23,977 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:23,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:24,177 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:24,178 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:24,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1117242766, now seen corresponding path program 1 times [2024-10-23 22:34:24,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:24,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309152952] [2024-10-23 22:34:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:24,179 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,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:24,180 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:24,181 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:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:24,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:34:24,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:24,260 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:24,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:34:24,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309152952] [2024-10-23 22:34:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309152952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:34:24,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:34:24,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 22:34:24,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662243933] [2024-10-23 22:34:24,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:34:24,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:34:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:24,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:34:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:34:24,262 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:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:24,290 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-10-23 22:34:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:34:24,291 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:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:24,294 INFO L225 Difference]: With dead ends: 63 [2024-10-23 22:34:24,294 INFO L226 Difference]: Without dead ends: 43 [2024-10-23 22:34:24,294 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:24,295 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:24,295 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:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-23 22:34:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-23 22:34:24,299 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:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-23 22:34:24,300 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 56 [2024-10-23 22:34:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:24,300 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-23 22:34:24,300 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:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-23 22:34:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-23 22:34:24,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:34:24,304 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:24,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:24,505 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:24,505 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 22:34:24,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:34:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1847352557, now seen corresponding path program 1 times [2024-10-23 22:34:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:34:24,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502360294] [2024-10-23 22:34:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:34:24,506 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,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:34:24,509 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:24,510 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:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:34:24,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 22:34:24,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:34:24,712 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:24,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 22:34:24,833 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:24,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:34:24,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502360294] [2024-10-23 22:34:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502360294] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 22:34:24,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 22:34:24,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-23 22:34:24,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637112990] [2024-10-23 22:34:24,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 22:34:24,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-23 22:34:24,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:34:24,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-23 22:34:24,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-23 22:34:24,835 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:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:34:24,962 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-23 22:34:24,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-23 22:34:24,963 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:24,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:34:24,963 INFO L225 Difference]: With dead ends: 44 [2024-10-23 22:34:24,963 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 22:34:24,964 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:24,964 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:24,964 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:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 22:34:24,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 22:34:24,965 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:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 22:34:24,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2024-10-23 22:34:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:34:24,965 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 22:34:24,965 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:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 22:34:24,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 22:34:24,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-23 22:34:24,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-23 22:34:24,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-10-23 22:34:25,168 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:25,171 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:25,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 22:34:26,024 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 22:34:26,044 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-23 22:34:26,045 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-23 22:34:26,072 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-23 22:34:26,072 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-23 22:34:26,074 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-23 22:34:26,075 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:26,079 INFO L158 Benchmark]: Toolchain (without parser) took 26431.36ms. Allocated memory was 58.7MB in the beginning and 107.0MB in the end (delta: 48.2MB). Free memory was 38.3MB in the beginning and 35.9MB in the end (delta: 2.4MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2024-10-23 22:34:26,079 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 48.2MB. Free memory was 29.6MB in the beginning and 29.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:34:26,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.63ms. Allocated memory is still 58.7MB. Free memory was 38.1MB in the beginning and 24.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 22:34:26,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.69ms. Allocated memory is still 58.7MB. Free memory was 24.2MB in the beginning and 38.4MB in the end (delta: -14.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-23 22:34:26,080 INFO L158 Benchmark]: Boogie Preprocessor took 74.19ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 36.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:34:26,080 INFO L158 Benchmark]: RCFGBuilder took 541.19ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 33.8MB in the end (delta: 2.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-10-23 22:34:26,080 INFO L158 Benchmark]: TraceAbstraction took 25413.86ms. Allocated memory was 58.7MB in the beginning and 107.0MB in the end (delta: 48.2MB). Free memory was 33.3MB in the beginning and 35.9MB in the end (delta: -2.6MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2024-10-23 22:34:26,081 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.36ms. Allocated memory is still 48.2MB. Free memory was 29.6MB in the beginning and 29.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.63ms. Allocated memory is still 58.7MB. Free memory was 38.1MB in the beginning and 24.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.69ms. Allocated memory is still 58.7MB. Free memory was 24.2MB in the beginning and 38.4MB in the end (delta: -14.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.19ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 36.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 541.19ms. Allocated memory is still 58.7MB. Free memory was 36.0MB in the beginning and 33.8MB in the end (delta: 2.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25413.86ms. Allocated memory was 58.7MB in the beginning and 107.0MB in the end (delta: 48.2MB). Free memory was 33.3MB in the beginning and 35.9MB in the end (delta: -2.6MB). Peak memory consumption was 59.0MB. 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: 77]: 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: 83]: 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: 24.4s, OverallIterations: 28, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 464 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 7962 SdHoareTripleChecker+Invalid, 5.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.4s 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.9s SatisfiabilityAnalysisTime, 8.0s 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: 17]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 59]: 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:26,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NumberFormatException: Character I is neither a decimal digit number, decimal point, nor "e" notation exponential mark.