./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i -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 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:42:53,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:42:53,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:42:53,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:42:53,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:42:53,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:42:53,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:42:53,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:42:53,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:42:53,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:42:53,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:42:53,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:42:53,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:42:53,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:42:53,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:42:53,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:42:53,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:42:53,469 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 [2025-03-04 01:42:53,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:42:53,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:42:53,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:42:53,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:42:53,702 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:42:53,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2025-03-04 01:42:54,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70301bc5d/3450e6e8ec944f569dd1978bdc48bda3/FLAG6670cbd0c [2025-03-04 01:42:55,040 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:42:55,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2025-03-04 01:42:55,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70301bc5d/3450e6e8ec944f569dd1978bdc48bda3/FLAG6670cbd0c [2025-03-04 01:42:55,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70301bc5d/3450e6e8ec944f569dd1978bdc48bda3 [2025-03-04 01:42:55,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:42:55,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:42:55,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:42:55,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:42:55,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:42:55,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21eeb8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55, skipping insertion in model container [2025-03-04 01:42:55,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:42:55,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i[916,929] [2025-03-04 01:42:55,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:42:55,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:42:55,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i[916,929] [2025-03-04 01:42:55,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:42:55,602 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:42:55,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55 WrapperNode [2025-03-04 01:42:55,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:42:55,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:42:55,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:42:55,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:42:55,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,644 INFO L138 Inliner]: procedures = 30, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 507 [2025-03-04 01:42:55,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:42:55,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:42:55,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:42:55,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:42:55,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,663 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:42:55,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:42:55,686 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:42:55,686 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:42:55,686 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:42:55,687 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (1/1) ... [2025-03-04 01:42:55,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:42:55,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:55,713 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) [2025-03-04 01:42:55,716 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 [2025-03-04 01:42:55,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:42:55,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:42:55,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:42:55,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:42:55,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:42:55,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:42:55,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:42:55,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:42:55,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:42:55,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:42:55,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:42:55,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:42:55,811 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:42:55,812 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:42:56,257 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite111#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite130#1;havoc property_#t~mem120#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2025-03-04 01:42:56,287 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-04 01:42:56,287 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:42:56,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:42:56,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:42:56,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:42:56 BoogieIcfgContainer [2025-03-04 01:42:56,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:42:56,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:42:56,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:42:56,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:42:56,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:42:55" (1/3) ... [2025-03-04 01:42:56,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73317695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:42:56, skipping insertion in model container [2025-03-04 01:42:56,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:42:55" (2/3) ... [2025-03-04 01:42:56,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73317695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:42:56, skipping insertion in model container [2025-03-04 01:42:56,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:42:56" (3/3) ... [2025-03-04 01:42:56,306 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-68.i [2025-03-04 01:42:56,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:42:56,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-68.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:42:56,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:42:56,362 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;@40f66f14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:42:56,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:42:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:42:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:42:56,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:56,372 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:56,373 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:56,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:56,377 INFO L85 PathProgramCache]: Analyzing trace with hash 813634942, now seen corresponding path program 1 times [2025-03-04 01:42:56,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:56,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440629267] [2025-03-04 01:42:56,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:56,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:42:56,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:42:56,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:56,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:42:56,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440629267] [2025-03-04 01:42:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440629267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:42:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488004646] [2025-03-04 01:42:56,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:56,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:56,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:56,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:42:56,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:42:56,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:42:56,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:42:56,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:56,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:56,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:42:56,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:42:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:42:56,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:42:56,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488004646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:56,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:42:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:42:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105939358] [2025-03-04 01:42:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:56,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:42:56,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:56,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:42:56,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:42:56,978 INFO L87 Difference]: Start difference. First operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:42:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:56,995 INFO L93 Difference]: Finished difference Result 220 states and 342 transitions. [2025-03-04 01:42:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:42:56,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-03-04 01:42:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:57,000 INFO L225 Difference]: With dead ends: 220 [2025-03-04 01:42:57,000 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:42:57,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:42:57,005 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:57,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:42:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:42:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 01:42:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:42:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-03-04 01:42:57,029 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2025-03-04 01:42:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:57,030 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-03-04 01:42:57,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:42:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-03-04 01:42:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:42:57,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:57,032 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:57,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:42:57,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:42:57,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:57,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:57,233 INFO L85 PathProgramCache]: Analyzing trace with hash -911656629, now seen corresponding path program 1 times [2025-03-04 01:42:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207180934] [2025-03-04 01:42:57,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:57,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:42:57,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:42:57,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:57,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:42:57,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207180934] [2025-03-04 01:42:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207180934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:42:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630863966] [2025-03-04 01:42:57,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:57,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:57,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:57,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:42:57,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:42:57,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:42:57,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:42:57,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:57,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:57,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:42:57,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:42:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:42:57,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:42:57,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630863966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:57,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:42:57,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-04 01:42:57,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675098526] [2025-03-04 01:42:57,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:57,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:42:57,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:57,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:42:57,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:42:57,964 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:42:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:58,003 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2025-03-04 01:42:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:42:58,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-04 01:42:58,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:58,007 INFO L225 Difference]: With dead ends: 220 [2025-03-04 01:42:58,008 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 01:42:58,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:42:58,009 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:58,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:42:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 01:42:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-04 01:42:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:42:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2025-03-04 01:42:58,018 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 146 [2025-03-04 01:42:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:58,019 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2025-03-04 01:42:58,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:42:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2025-03-04 01:42:58,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:42:58,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:58,021 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:58,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:42:58,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 01:42:58,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:58,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1586359308, now seen corresponding path program 1 times [2025-03-04 01:42:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:58,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53614626] [2025-03-04 01:42:58,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:58,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:42:58,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:42:58,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:58,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:42:58,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:58,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53614626] [2025-03-04 01:42:58,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53614626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:42:58,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938121869] [2025-03-04 01:42:58,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:58,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:58,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:42:58,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:42:58,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:42:58,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:42:58,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:58,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:58,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:42:58,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:42:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:42:58,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:42:58,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938121869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:58,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:42:58,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-04 01:42:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237699675] [2025-03-04 01:42:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:58,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:42:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:58,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:42:58,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:42:58,740 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:42:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:58,770 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2025-03-04 01:42:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:42:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-04 01:42:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:58,774 INFO L225 Difference]: With dead ends: 224 [2025-03-04 01:42:58,774 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:42:58,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:42:58,776 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:58,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:42:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:42:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-04 01:42:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:42:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-04 01:42:58,789 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 146 [2025-03-04 01:42:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:58,790 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-04 01:42:58,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:42:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-04 01:42:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:42:58,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:58,794 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:58,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:42:58,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:58,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:58,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:58,995 INFO L85 PathProgramCache]: Analyzing trace with hash -221095155, now seen corresponding path program 1 times [2025-03-04 01:42:58,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:58,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708098524] [2025-03-04 01:42:58,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:59,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:42:59,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:42:59,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:59,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:42:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708098524] [2025-03-04 01:42:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708098524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:42:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968171638] [2025-03-04 01:42:59,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:59,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:59,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:59,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:42:59,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:42:59,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:42:59,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:42:59,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:59,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:59,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:42:59,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:42:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:42:59,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:42:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968171638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:42:59,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:42:59,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-04 01:42:59,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961299051] [2025-03-04 01:42:59,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:42:59,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:42:59,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:42:59,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:42:59,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:42:59,418 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:42:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:42:59,439 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2025-03-04 01:42:59,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:42:59,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-04 01:42:59,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:42:59,441 INFO L225 Difference]: With dead ends: 228 [2025-03-04 01:42:59,441 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:42:59,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:42:59,444 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:42:59,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:42:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:42:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-03-04 01:42:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:42:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-03-04 01:42:59,456 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 146 [2025-03-04 01:42:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:42:59,457 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-03-04 01:42:59,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:42:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-03-04 01:42:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:42:59,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:42:59,475 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:42:59,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:42:59,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:59,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:42:59,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:42:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash 666408526, now seen corresponding path program 1 times [2025-03-04 01:42:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:42:59,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915077830] [2025-03-04 01:42:59,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:42:59,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:42:59,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:42:59,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:42:59,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:42:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:42:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:42:59,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915077830] [2025-03-04 01:42:59,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915077830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:42:59,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080285948] [2025-03-04 01:42:59,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:42:59,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:42:59,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:42:59,862 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:42:59,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:43:00,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:00,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:00,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:00,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:00,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:43:00,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:00,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:00,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080285948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:00,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:43:00,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-04 01:43:00,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366914914] [2025-03-04 01:43:00,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:00,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:43:00,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:00,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:43:00,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:00,086 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:00,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:00,107 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-03-04 01:43:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:43:00,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-04 01:43:00,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:00,109 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:43:00,109 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:43:00,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:00,110 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:00,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:43:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-04 01:43:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-03-04 01:43:00,122 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 146 [2025-03-04 01:43:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:00,123 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-03-04 01:43:00,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-03-04 01:43:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:43:00,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:00,124 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:00,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:43:00,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:00,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:00,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:00,325 INFO L85 PathProgramCache]: Analyzing trace with hash 667332047, now seen corresponding path program 1 times [2025-03-04 01:43:00,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:00,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116228105] [2025-03-04 01:43:00,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:00,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:00,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:00,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:00,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:43:00,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:00,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116228105] [2025-03-04 01:43:00,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116228105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:43:00,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208667491] [2025-03-04 01:43:00,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:00,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:00,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:43:00,497 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:43:00,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:43:00,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:00,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:00,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:00,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:00,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:43:00,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:00,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:00,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208667491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:00,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:43:00,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:43:00,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498130252] [2025-03-04 01:43:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:00,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:00,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:00,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:00,710 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:00,735 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-03-04 01:43:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:00,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-04 01:43:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:00,737 INFO L225 Difference]: With dead ends: 236 [2025-03-04 01:43:00,737 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 01:43:00,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:00,738 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:00,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 01:43:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-04 01:43:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2025-03-04 01:43:00,750 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 146 [2025-03-04 01:43:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:00,751 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2025-03-04 01:43:00,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2025-03-04 01:43:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:43:00,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:00,752 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:00,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 01:43:00,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:00,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:00,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash -209993560, now seen corresponding path program 1 times [2025-03-04 01:43:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:00,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862515942] [2025-03-04 01:43:00,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:00,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:00,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:01,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:01,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:01,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:43:01,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862515942] [2025-03-04 01:43:01,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862515942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:43:01,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210275604] [2025-03-04 01:43:01,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:01,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:01,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:43:01,180 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:43:01,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:43:01,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:01,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:01,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:01,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:01,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:43:01,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:01,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210275604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:01,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:43:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:43:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637677706] [2025-03-04 01:43:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:01,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:01,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:01,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:01,420 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:01,443 INFO L93 Difference]: Finished difference Result 242 states and 343 transitions. [2025-03-04 01:43:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:01,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-04 01:43:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:01,444 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:43:01,444 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 01:43:01,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:01,445 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:01,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 01:43:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2025-03-04 01:43:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2025-03-04 01:43:01,450 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 146 [2025-03-04 01:43:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:01,451 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2025-03-04 01:43:01,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2025-03-04 01:43:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:01,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:01,452 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:01,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:43:01,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:01,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:01,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash -960472911, now seen corresponding path program 1 times [2025-03-04 01:43:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:01,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531259101] [2025-03-04 01:43:01,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:01,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:01,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:01,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:01,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:01,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:01,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531259101] [2025-03-04 01:43:01,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531259101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:01,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:01,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:43:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47728775] [2025-03-04 01:43:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:01,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:43:01,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:01,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:43:01,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:43:01,927 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:01,941 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2025-03-04 01:43:01,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:43:01,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-04 01:43:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:01,943 INFO L225 Difference]: With dead ends: 241 [2025-03-04 01:43:01,943 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:43:01,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:43:01,944 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:01,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:43:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 01:43:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2025-03-04 01:43:01,952 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 148 [2025-03-04 01:43:01,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:01,952 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2025-03-04 01:43:01,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2025-03-04 01:43:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:01,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:01,955 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:01,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:43:01,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:01,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:01,955 INFO L85 PathProgramCache]: Analyzing trace with hash -929453104, now seen corresponding path program 1 times [2025-03-04 01:43:01,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:01,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639505245] [2025-03-04 01:43:01,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:01,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:01,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:02,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:02,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:02,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:02,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:02,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639505245] [2025-03-04 01:43:02,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639505245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:02,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:02,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:02,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596156640] [2025-03-04 01:43:02,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:02,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:02,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:02,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:02,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:02,213 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:02,561 INFO L93 Difference]: Finished difference Result 310 states and 431 transitions. [2025-03-04 01:43:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-04 01:43:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:02,562 INFO L225 Difference]: With dead ends: 310 [2025-03-04 01:43:02,563 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 01:43:02,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:02,564 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 77 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:02,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 418 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:43:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 01:43:02,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2025-03-04 01:43:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.3251533742331287) internal successors, (216), 164 states have internal predecessors, (216), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:43:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 260 transitions. [2025-03-04 01:43:02,574 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 260 transitions. Word has length 148 [2025-03-04 01:43:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:02,575 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 260 transitions. [2025-03-04 01:43:02,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 260 transitions. [2025-03-04 01:43:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:02,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:02,580 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:02,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:43:02,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:02,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash 393084684, now seen corresponding path program 1 times [2025-03-04 01:43:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:02,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479312195] [2025-03-04 01:43:02,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:02,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:02,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:02,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:02,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:02,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479312195] [2025-03-04 01:43:02,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479312195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:02,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:02,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:02,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361127755] [2025-03-04 01:43:02,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:02,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:02,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:02,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:02,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:02,722 INFO L87 Difference]: Start difference. First operand 188 states and 260 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:03,152 INFO L93 Difference]: Finished difference Result 441 states and 614 transitions. [2025-03-04 01:43:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:03,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-04 01:43:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:03,155 INFO L225 Difference]: With dead ends: 441 [2025-03-04 01:43:03,155 INFO L226 Difference]: Without dead ends: 256 [2025-03-04 01:43:03,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:03,156 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 130 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:03,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 544 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:43:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-04 01:43:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 251. [2025-03-04 01:43:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 207 states have (on average 1.3043478260869565) internal successors, (270), 209 states have internal predecessors, (270), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-04 01:43:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 348 transitions. [2025-03-04 01:43:03,169 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 348 transitions. Word has length 148 [2025-03-04 01:43:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:03,170 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 348 transitions. [2025-03-04 01:43:03,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 348 transitions. [2025-03-04 01:43:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:03,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:03,172 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:43:03,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:03,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash -117449493, now seen corresponding path program 1 times [2025-03-04 01:43:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:03,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791468185] [2025-03-04 01:43:03,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:03,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:03,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:03,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:03,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:03,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:43:03,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:43:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791468185] [2025-03-04 01:43:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791468185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:43:03,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260138846] [2025-03-04 01:43:03,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:03,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:03,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:43:03,351 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:43:03,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 01:43:03,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:03,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:03,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:03,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:03,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:43:03,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:03,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:03,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260138846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:03,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:43:03,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:43:03,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174540708] [2025-03-04 01:43:03,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:03,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:03,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:43:03,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:03,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:03,616 INFO L87 Difference]: Start difference. First operand 251 states and 348 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:03,642 INFO L93 Difference]: Finished difference Result 440 states and 609 transitions. [2025-03-04 01:43:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:03,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-04 01:43:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:03,645 INFO L225 Difference]: With dead ends: 440 [2025-03-04 01:43:03,646 INFO L226 Difference]: Without dead ends: 255 [2025-03-04 01:43:03,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:03,647 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:03,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-04 01:43:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-03-04 01:43:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 213 states have internal predecessors, (274), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-04 01:43:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 352 transitions. [2025-03-04 01:43:03,666 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 352 transitions. Word has length 148 [2025-03-04 01:43:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 352 transitions. [2025-03-04 01:43:03,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 352 transitions. [2025-03-04 01:43:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:03,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:03,670 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:03,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:43:03,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 01:43:03,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:03,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash -424465527, now seen corresponding path program 1 times [2025-03-04 01:43:03,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:43:03,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453656765] [2025-03-04 01:43:03,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:03,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:43:03,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:03,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:43:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263865207] [2025-03-04 01:43:03,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:03,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:03,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:43:03,993 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:43:03,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 01:43:04,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:04,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:04,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:04,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:43:04,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:43:04,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:06,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:06,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:06,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:43:06,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:43:06,900 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:43:06,901 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:43:06,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 01:43:07,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:43:07,105 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:07,144 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:43:07,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:43:07 BoogieIcfgContainer [2025-03-04 01:43:07,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:43:07,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:43:07,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:43:07,147 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:43:07,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:42:56" (3/4) ... [2025-03-04 01:43:07,149 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:43:07,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:43:07,150 INFO L158 Benchmark]: Toolchain (without parser) took 11761.28ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 113.7MB in the beginning and 87.0MB in the end (delta: 26.8MB). Peak memory consumption was 110.5MB. Max. memory is 16.1GB. [2025-03-04 01:43:07,150 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:43:07,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.64ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 96.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:43:07,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:43:07,151 INFO L158 Benchmark]: Boogie Preprocessor took 40.97ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:43:07,151 INFO L158 Benchmark]: IcfgBuilder took 611.38ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 56.9MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:43:07,151 INFO L158 Benchmark]: TraceAbstraction took 10846.63ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 56.4MB in the beginning and 87.0MB in the end (delta: -30.6MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2025-03-04 01:43:07,151 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 226.5MB. Free memory was 87.0MB in the beginning and 87.0MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:43:07,154 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.64ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 96.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.97ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 89.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 611.38ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 56.9MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10846.63ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 56.4MB in the beginning and 87.0MB in the end (delta: -30.6MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 226.5MB. Free memory was 87.0MB in the beginning and 87.0MB in the end (delta: 45.1kB). 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: 19]: 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 99, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 108. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L61] signed short int last_1_WrapperStruct00_var_1_13 = -25; [L62] signed long int last_1_WrapperStruct00_var_1_17 = 5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L125] EXPR WrapperStruct00.var_1_13 [L125] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L126] EXPR WrapperStruct00.var_1_17 [L126] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L136] RET updateLastVariables() [L137] CALL updateVariables() [L96] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L98] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L109] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_12 [L110] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_12 [L110] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L112] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L115] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L117] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ulong() [L121] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L137] RET updateVariables() [L138] CALL step() [L66] EXPR WrapperStruct00.var_1_8 [L66] signed long int stepLocal_2 = WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17; [L67] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_2=7] [L67] COND FALSE !(WrapperStruct00.var_1_9) [L74] EXPR WrapperStruct00.var_1_15 [L74] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_15 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_14 [L76] WrapperStruct00.var_1_17 = (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14) [L77] EXPR WrapperStruct00.var_1_19 [L77] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L78] EXPR WrapperStruct00.var_1_12 [L78] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_12 [L79] EXPR WrapperStruct00.var_1_17 [L79] WrapperStruct00.var_1_21 = WrapperStruct00.var_1_17 [L80] EXPR WrapperStruct00.var_1_17 [L80] signed long int stepLocal_1 = WrapperStruct00.var_1_17; [L81] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_1=-8, stepLocal_2=7] [L81] COND FALSE !(stepLocal_1 != WrapperStruct00.var_1_21) [L84] EXPR WrapperStruct00.var_1_18 [L84] EXPR WrapperStruct00.var_1_21 [L84] unsigned long int stepLocal_0 = WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21; [L85] EXPR WrapperStruct00.var_1_2 [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=23, stepLocal_2=7] [L85] COND FALSE !((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) [L90] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=23, stepLocal_2=7] [L90] COND FALSE !(WrapperStruct00.var_1_9) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR WrapperStruct00.var_1_2 [L129] EXPR WrapperStruct00.var_1_3 [L129] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1) [L129] EXPR WrapperStruct00.var_1_18 [L129] EXPR WrapperStruct00.var_1_21 [L129] EXPR WrapperStruct00.var_1_13 [L129] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1 [L129] EXPR WrapperStruct00.var_1_1 [L129] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21) [L129] EXPR WrapperStruct00.var_1_21 [L129] EXPR ((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129-L130] return ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 5115 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3387 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 1728 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1237 GetRequests, 1179 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=11, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 14 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3080 NumberOfCodeBlocks, 3080 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 3058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4461 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 10073/10336 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:43:07,171 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i -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 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:43:08,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:43:09,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:43:09,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:43:09,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:43:09,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:43:09,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:43:09,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:43:09,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:43:09,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:43:09,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:43:09,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:43:09,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:43:09,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:43:09,087 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:43:09,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:43:09,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:43:09,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:43:09,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:43:09,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:43:09,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:43:09,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:43:09,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:43:09,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:43:09,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:43:09,090 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:43:09,090 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:43:09,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:43:09,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:43:09,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:43:09,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:43:09,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 [2025-03-04 01:43:09,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:43:09,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:43:09,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:43:09,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:43:09,351 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:43:09,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2025-03-04 01:43:10,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8980740d/78c7a2c91c5f42c599d7f3fff508a0f9/FLAG7b0a49f1f [2025-03-04 01:43:10,693 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:43:10,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2025-03-04 01:43:10,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8980740d/78c7a2c91c5f42c599d7f3fff508a0f9/FLAG7b0a49f1f [2025-03-04 01:43:10,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8980740d/78c7a2c91c5f42c599d7f3fff508a0f9 [2025-03-04 01:43:10,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:43:10,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:43:10,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:43:10,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:43:10,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:43:10,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:10,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa36660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10, skipping insertion in model container [2025-03-04 01:43:10,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:10,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:43:10,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i[916,929] [2025-03-04 01:43:10,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:43:10,899 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:43:10,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i[916,929] [2025-03-04 01:43:10,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:43:10,978 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:43:10,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10 WrapperNode [2025-03-04 01:43:10,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:43:10,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:43:10,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:43:10,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:43:10,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,039 INFO L138 Inliner]: procedures = 40, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2025-03-04 01:43:11,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:43:11,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:43:11,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:43:11,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:43:11,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,084 INFO L175 MemorySlicer]: Split 143 memory accesses to 2 slices as follows [2, 141]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2025-03-04 01:43:11,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:43:11,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:43:11,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:43:11,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:43:11,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (1/1) ... [2025-03-04 01:43:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:43:11,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:43:11,164 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) [2025-03-04 01:43:11,171 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 [2025-03-04 01:43:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:43:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:43:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:43:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:43:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:43:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:43:11,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:43:11,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:43:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:43:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:43:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:43:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:43:11,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:43:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:43:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:43:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:43:11,188 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:43:11,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:43:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:43:11,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:43:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:43:11,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:43:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:43:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:43:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:43:11,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:43:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:43:11,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:43:11,291 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:43:11,293 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:43:14,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite111#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite117#1;havoc property_#t~mem116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite130#1;havoc property_#t~mem120#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2025-03-04 01:43:14,607 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-04 01:43:14,608 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:43:14,618 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:43:14,619 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:43:14,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:43:14 BoogieIcfgContainer [2025-03-04 01:43:14,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:43:14,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:43:14,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:43:14,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:43:14,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:43:10" (1/3) ... [2025-03-04 01:43:14,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b44e097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:43:14, skipping insertion in model container [2025-03-04 01:43:14,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:43:10" (2/3) ... [2025-03-04 01:43:14,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b44e097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:43:14, skipping insertion in model container [2025-03-04 01:43:14,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:43:14" (3/3) ... [2025-03-04 01:43:14,627 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-68.i [2025-03-04 01:43:14,636 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:43:14,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-68.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:43:14,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:43:14,676 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;@100fef16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:43:14,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:43:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:43:14,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:14,689 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:14,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:14,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1440182119, now seen corresponding path program 1 times [2025-03-04 01:43:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:14,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283590812] [2025-03-04 01:43:14,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:14,702 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 [2025-03-04 01:43:14,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:14,706 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) [2025-03-04 01:43:14,707 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 [2025-03-04 01:43:14,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:15,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:15,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:15,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:15,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:43:15,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-04 01:43:15,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:15,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:15,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283590812] [2025-03-04 01:43:15,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283590812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:15,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:15,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:43:15,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829303505] [2025-03-04 01:43:15,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:15,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:43:15,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:15,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:43:15,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:43:15,252 INFO L87 Difference]: Start difference. First operand has 113 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:43:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:15,272 INFO L93 Difference]: Finished difference Result 220 states and 342 transitions. [2025-03-04 01:43:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:43:15,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2025-03-04 01:43:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:15,281 INFO L225 Difference]: With dead ends: 220 [2025-03-04 01:43:15,281 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:43:15,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:43:15,285 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:15,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:43:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 01:43:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-03-04 01:43:15,331 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2025-03-04 01:43:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:15,332 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-03-04 01:43:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:43:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-03-04 01:43:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:43:15,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:15,335 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:15,351 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 [2025-03-04 01:43:15,536 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 [2025-03-04 01:43:15,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:15,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash -285109452, now seen corresponding path program 1 times [2025-03-04 01:43:15,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:15,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597220460] [2025-03-04 01:43:15,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:15,538 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 [2025-03-04 01:43:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:15,540 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) [2025-03-04 01:43:15,541 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 [2025-03-04 01:43:15,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:15,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:15,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:15,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:15,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:43:15,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:16,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:16,044 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:16,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597220460] [2025-03-04 01:43:16,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597220460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:16,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:16,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:16,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941774618] [2025-03-04 01:43:16,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:16,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:16,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:16,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:16,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:16,046 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:16,096 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2025-03-04 01:43:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-04 01:43:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:16,098 INFO L225 Difference]: With dead ends: 220 [2025-03-04 01:43:16,098 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 01:43:16,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:16,099 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:16,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 01:43:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-04 01:43:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2025-03-04 01:43:16,111 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 146 [2025-03-04 01:43:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:16,113 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2025-03-04 01:43:16,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2025-03-04 01:43:16,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:43:16,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:16,116 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:16,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:43:16,316 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 [2025-03-04 01:43:16,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:16,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash 592216155, now seen corresponding path program 1 times [2025-03-04 01:43:16,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:16,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037709472] [2025-03-04 01:43:16,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:16,318 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 [2025-03-04 01:43:16,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:16,320 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) [2025-03-04 01:43:16,320 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 [2025-03-04 01:43:16,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:43:16,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:43:16,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:16,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:16,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:43:16,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:16,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:16,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:16,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037709472] [2025-03-04 01:43:16,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037709472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:16,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895630035] [2025-03-04 01:43:16,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:16,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:16,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:16,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:16,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:16,778 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:16,829 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2025-03-04 01:43:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:16,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2025-03-04 01:43:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:16,831 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:43:16,831 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:43:16,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:16,832 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:16,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:43:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2025-03-04 01:43:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-04 01:43:16,841 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 146 [2025-03-04 01:43:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:16,841 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-04 01:43:16,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-04 01:43:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:16,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:16,843 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:16,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:43:17,043 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 [2025-03-04 01:43:17,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 78260086, now seen corresponding path program 1 times [2025-03-04 01:43:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063715818] [2025-03-04 01:43:17,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:17,045 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 [2025-03-04 01:43:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:17,048 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) [2025-03-04 01:43:17,048 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 [2025-03-04 01:43:17,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:17,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:17,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:17,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:17,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:43:17,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:17,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:17,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:17,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063715818] [2025-03-04 01:43:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063715818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:17,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781879345] [2025-03-04 01:43:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:17,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:17,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:17,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:17,498 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:17,541 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2025-03-04 01:43:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:17,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-04 01:43:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:17,544 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:43:17,544 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:43:17,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:17,545 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:17,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 604 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:43:17,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-04 01:43:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-03-04 01:43:17,554 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 148 [2025-03-04 01:43:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:17,554 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-03-04 01:43:17,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-03-04 01:43:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:17,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:17,558 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:17,573 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 [2025-03-04 01:43:17,758 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 [2025-03-04 01:43:17,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:17,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1718691273, now seen corresponding path program 1 times [2025-03-04 01:43:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:17,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046522918] [2025-03-04 01:43:17,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:17,760 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 [2025-03-04 01:43:17,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:17,761 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) [2025-03-04 01:43:17,763 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 [2025-03-04 01:43:17,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:18,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:18,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:18,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:18,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:43:18,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:18,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:18,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:18,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046522918] [2025-03-04 01:43:18,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046522918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:18,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:18,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:18,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687039913] [2025-03-04 01:43:18,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:18,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:18,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:18,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:18,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:18,220 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:18,269 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-03-04 01:43:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:18,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-04 01:43:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:18,271 INFO L225 Difference]: With dead ends: 236 [2025-03-04 01:43:18,271 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 01:43:18,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:18,271 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:18,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 745 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 01:43:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-03-04 01:43:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2025-03-04 01:43:18,276 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 148 [2025-03-04 01:43:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:18,276 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2025-03-04 01:43:18,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:18,277 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2025-03-04 01:43:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:18,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:18,277 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:18,293 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 [2025-03-04 01:43:18,478 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 [2025-03-04 01:43:18,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:18,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash 768821560, now seen corresponding path program 1 times [2025-03-04 01:43:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:18,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139098385] [2025-03-04 01:43:18,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:18,479 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 [2025-03-04 01:43:18,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:18,481 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) [2025-03-04 01:43:18,482 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 [2025-03-04 01:43:18,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:18,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:18,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:18,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:18,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:43:18,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:18,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:18,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139098385] [2025-03-04 01:43:18,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139098385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:18,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:18,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:43:18,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102570808] [2025-03-04 01:43:18,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:18,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:43:18,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:18,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:43:18,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:18,924 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:19,063 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2025-03-04 01:43:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:43:19,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-04 01:43:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:19,064 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:43:19,064 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:43:19,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:19,065 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:19,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 882 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:43:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:43:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-04 01:43:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2025-03-04 01:43:19,072 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 148 [2025-03-04 01:43:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:19,072 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2025-03-04 01:43:19,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2025-03-04 01:43:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:19,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:19,073 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:19,091 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 [2025-03-04 01:43:19,274 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 [2025-03-04 01:43:19,274 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:19,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1656325241, now seen corresponding path program 1 times [2025-03-04 01:43:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810406652] [2025-03-04 01:43:19,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:19,275 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 [2025-03-04 01:43:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:19,277 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) [2025-03-04 01:43:19,278 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 [2025-03-04 01:43:19,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:19,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:19,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:19,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:19,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:43:19,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:19,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:19,719 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810406652] [2025-03-04 01:43:19,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810406652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:19,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:19,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:43:19,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724761336] [2025-03-04 01:43:19,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:19,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:43:19,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:19,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:43:19,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:19,720 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:19,896 INFO L93 Difference]: Finished difference Result 244 states and 345 transitions. [2025-03-04 01:43:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:43:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-04 01:43:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:19,897 INFO L225 Difference]: With dead ends: 244 [2025-03-04 01:43:19,898 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:43:19,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:43:19,898 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:19,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1021 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:43:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:43:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-04 01:43:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2025-03-04 01:43:19,904 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 148 [2025-03-04 01:43:19,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:19,905 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2025-03-04 01:43:19,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2025-03-04 01:43:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:43:19,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:19,908 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:19,925 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 [2025-03-04 01:43:20,108 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 [2025-03-04 01:43:20,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:20,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1657248762, now seen corresponding path program 1 times [2025-03-04 01:43:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:20,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782795511] [2025-03-04 01:43:20,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:20,109 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 [2025-03-04 01:43:20,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:20,111 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) [2025-03-04 01:43:20,113 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 [2025-03-04 01:43:20,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:43:20,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:43:20,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:20,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:20,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:43:20,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:20,619 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 95 treesize of output 41 [2025-03-04 01:43:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:20,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:20,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:20,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782795511] [2025-03-04 01:43:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782795511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:20,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:20,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:20,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987032259] [2025-03-04 01:43:20,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:20,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:20,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:20,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:20,650 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:22,815 INFO L93 Difference]: Finished difference Result 246 states and 346 transitions. [2025-03-04 01:43:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:43:22,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2025-03-04 01:43:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:22,819 INFO L225 Difference]: With dead ends: 246 [2025-03-04 01:43:22,819 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:43:22,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:22,820 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 154 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:22,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 453 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 01:43:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:43:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-04 01:43:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2025-03-04 01:43:22,827 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 148 [2025-03-04 01:43:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:22,827 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2025-03-04 01:43:22,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2025-03-04 01:43:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:43:22,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:22,828 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:22,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:43:23,030 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 [2025-03-04 01:43:23,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:23,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:23,031 INFO L85 PathProgramCache]: Analyzing trace with hash -444222056, now seen corresponding path program 1 times [2025-03-04 01:43:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256653962] [2025-03-04 01:43:23,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:23,031 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 [2025-03-04 01:43:23,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:23,033 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) [2025-03-04 01:43:23,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:43:23,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:43:23,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:43:23,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:23,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:23,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:43:23,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:23,487 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 95 treesize of output 41 [2025-03-04 01:43:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:43:23,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:23,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256653962] [2025-03-04 01:43:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256653962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956729889] [2025-03-04 01:43:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:23,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:23,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:23,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:23,510 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:43:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:25,660 INFO L93 Difference]: Finished difference Result 246 states and 344 transitions. [2025-03-04 01:43:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:43:25,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-04 01:43:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:25,661 INFO L225 Difference]: With dead ends: 246 [2025-03-04 01:43:25,661 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:43:25,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:25,662 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 143 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:25,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 448 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 01:43:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:43:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-04 01:43:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2025-03-04 01:43:25,669 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 150 [2025-03-04 01:43:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:25,670 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2025-03-04 01:43:25,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:43:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2025-03-04 01:43:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-04 01:43:25,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:25,672 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:25,688 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 [2025-03-04 01:43:25,872 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 [2025-03-04 01:43:25,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:25,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash 182919290, now seen corresponding path program 1 times [2025-03-04 01:43:25,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:25,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005519709] [2025-03-04 01:43:25,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:25,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:43:25,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:25,875 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) [2025-03-04 01:43:25,877 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 [2025-03-04 01:43:25,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 01:43:26,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 01:43:26,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:26,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:26,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:43:26,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:26,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:43:26,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:43:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:43:26,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:26,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:26,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005519709] [2025-03-04 01:43:26,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005519709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:26,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:26,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:26,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538637513] [2025-03-04 01:43:26,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:26,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:26,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:26,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:26,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:26,431 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:43:27,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:43:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:29,419 INFO L93 Difference]: Finished difference Result 246 states and 342 transitions. [2025-03-04 01:43:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:43:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2025-03-04 01:43:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:29,420 INFO L225 Difference]: With dead ends: 246 [2025-03-04 01:43:29,420 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:43:29,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:29,421 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 118 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:29,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 447 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 01:43:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:43:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-04 01:43:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 105 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2025-03-04 01:43:29,425 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 152 [2025-03-04 01:43:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:29,425 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2025-03-04 01:43:29,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:43:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2025-03-04 01:43:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:43:29,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:29,428 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:29,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:43:29,628 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 [2025-03-04 01:43:29,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:29,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:29,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1378520168, now seen corresponding path program 1 times [2025-03-04 01:43:29,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:29,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399495101] [2025-03-04 01:43:29,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:29,629 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 [2025-03-04 01:43:29,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:29,631 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) [2025-03-04 01:43:29,633 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 [2025-03-04 01:43:29,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:43:30,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:43:30,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:30,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:30,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:43:30,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:30,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:43:30,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:43:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-04 01:43:30,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:30,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399495101] [2025-03-04 01:43:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399495101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067357826] [2025-03-04 01:43:30,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:30,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:30,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:30,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:30,307 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:43:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:32,876 INFO L93 Difference]: Finished difference Result 246 states and 340 transitions. [2025-03-04 01:43:32,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:43:32,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-03-04 01:43:32,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:32,879 INFO L225 Difference]: With dead ends: 246 [2025-03-04 01:43:32,879 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:43:32,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:43:32,879 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:32,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 441 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 01:43:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:43:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-03-04 01:43:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2025-03-04 01:43:32,883 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 154 [2025-03-04 01:43:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:32,884 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2025-03-04 01:43:32,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:43:32,884 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2025-03-04 01:43:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:43:32,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:32,885 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:32,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-03-04 01:43:33,089 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 [2025-03-04 01:43:33,089 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:33,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:33,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1113733242, now seen corresponding path program 1 times [2025-03-04 01:43:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:33,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178190572] [2025-03-04 01:43:33,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:33,090 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 [2025-03-04 01:43:33,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:33,092 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) [2025-03-04 01:43:33,093 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 [2025-03-04 01:43:33,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:43:33,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:43:33,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:33,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:33,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:43:33,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:34,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:34,482 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:34,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178190572] [2025-03-04 01:43:34,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178190572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:34,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:34,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:43:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424657083] [2025-03-04 01:43:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:34,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:43:34,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:34,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:43:34,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:34,483 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:35,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:43:40,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:43:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:46,002 INFO L93 Difference]: Finished difference Result 293 states and 398 transitions. [2025-03-04 01:43:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:43:46,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-03-04 01:43:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:46,008 INFO L225 Difference]: With dead ends: 293 [2025-03-04 01:43:46,008 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 01:43:46,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:43:46,009 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 50 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:46,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 325 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 11.5s Time] [2025-03-04 01:43:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 01:43:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 127. [2025-03-04 01:43:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 108 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2025-03-04 01:43:46,014 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 156 [2025-03-04 01:43:46,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:46,015 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2025-03-04 01:43:46,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2025-03-04 01:43:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:43:46,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:46,017 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:46,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-04 01:43:46,218 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 [2025-03-04 01:43:46,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:46,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash 634965142, now seen corresponding path program 1 times [2025-03-04 01:43:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:46,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930348829] [2025-03-04 01:43:46,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:46,219 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 [2025-03-04 01:43:46,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:46,221 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) [2025-03-04 01:43:46,222 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 [2025-03-04 01:43:46,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:43:46,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:43:46,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:46,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:46,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:43:46,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:46,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 7 [2025-03-04 01:43:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:46,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:46,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930348829] [2025-03-04 01:43:46,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930348829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:46,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:46,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:43:46,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761106347] [2025-03-04 01:43:46,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:46,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:43:46,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:46,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:43:46,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:43:46,987 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:46,999 INFO L93 Difference]: Finished difference Result 251 states and 345 transitions. [2025-03-04 01:43:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:43:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-03-04 01:43:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:47,001 INFO L225 Difference]: With dead ends: 251 [2025-03-04 01:43:47,001 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 01:43:47,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:43:47,002 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:47,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 01:43:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-04 01:43:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2025-03-04 01:43:47,006 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 156 [2025-03-04 01:43:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:47,006 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2025-03-04 01:43:47,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2025-03-04 01:43:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:43:47,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:47,007 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:47,025 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 [2025-03-04 01:43:47,207 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 [2025-03-04 01:43:47,208 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:47,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:47,208 INFO L85 PathProgramCache]: Analyzing trace with hash 665984949, now seen corresponding path program 1 times [2025-03-04 01:43:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:47,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097881466] [2025-03-04 01:43:47,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:47,209 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 [2025-03-04 01:43:47,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:47,210 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) [2025-03-04 01:43:47,212 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 [2025-03-04 01:43:47,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:43:47,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:43:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:47,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:43:47,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:47,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:43:47,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2025-03-04 01:43:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:47,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:47,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097881466] [2025-03-04 01:43:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097881466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:47,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035135129] [2025-03-04 01:43:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:47,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:47,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:47,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:47,729 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:49,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:43:51,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:43:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:53,494 INFO L93 Difference]: Finished difference Result 315 states and 433 transitions. [2025-03-04 01:43:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:53,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-03-04 01:43:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:53,502 INFO L225 Difference]: With dead ends: 315 [2025-03-04 01:43:53,502 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 01:43:53,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:43:53,502 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 126 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:53,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 516 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-04 01:43:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 01:43:53,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 127. [2025-03-04 01:43:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 108 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 172 transitions. [2025-03-04 01:43:53,513 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 172 transitions. Word has length 156 [2025-03-04 01:43:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:53,514 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 172 transitions. [2025-03-04 01:43:53,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 172 transitions. [2025-03-04 01:43:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:43:53,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:53,515 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:53,532 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 [2025-03-04 01:43:53,715 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 [2025-03-04 01:43:53,716 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:53,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 155450772, now seen corresponding path program 1 times [2025-03-04 01:43:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:53,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554826305] [2025-03-04 01:43:53,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:53,716 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 [2025-03-04 01:43:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:53,718 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) [2025-03-04 01:43:53,719 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 [2025-03-04 01:43:53,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 01:43:54,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 01:43:54,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:43:54,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:43:54,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:43:54,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:43:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:43:54,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:43:54,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:43:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554826305] [2025-03-04 01:43:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554826305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:43:54,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:43:54,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:43:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481782590] [2025-03-04 01:43:54,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:43:54,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:43:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:43:54,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:43:54,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:54,127 INFO L87 Difference]: Start difference. First operand 127 states and 172 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:43:54,160 INFO L93 Difference]: Finished difference Result 251 states and 341 transitions. [2025-03-04 01:43:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:43:54,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 156 [2025-03-04 01:43:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:43:54,163 INFO L225 Difference]: With dead ends: 251 [2025-03-04 01:43:54,163 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 01:43:54,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:43:54,165 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:43:54,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:43:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 01:43:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-04 01:43:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 108 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:43:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2025-03-04 01:43:54,174 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 156 [2025-03-04 01:43:54,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:43:54,174 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2025-03-04 01:43:54,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:43:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2025-03-04 01:43:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 01:43:54,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:43:54,175 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:43:54,190 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 [2025-03-04 01:43:54,375 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 [2025-03-04 01:43:54,375 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:43:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:43:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 639765472, now seen corresponding path program 1 times [2025-03-04 01:43:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:43:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618459326] [2025-03-04 01:43:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:43:54,376 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 [2025-03-04 01:43:54,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:43:54,378 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) [2025-03-04 01:43:54,379 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 [2025-03-04 01:43:54,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.