./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:19:00,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:19:00,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:19:00,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:19:00,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:19:00,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:19:00,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:19:00,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:19:00,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:19:00,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:19:00,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:19:00,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:19:00,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:19:00,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:19:00,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:19:00,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:19:00,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:19:00,627 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:19:00,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:19:00,627 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:19:00,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:19:00,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:19:00,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:19:00,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:19:00,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:19:00,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:19:00,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:19:00,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:19:00,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:19:00,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:19:00,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:19:00,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:19:00,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:19:00,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:19:00,629 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-jdk21/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 -> 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca [2025-02-06 03:19:00,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:19:00,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:19:00,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:19:00,883 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:19:00,883 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:19:00,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2025-02-06 03:19:02,169 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1bcc6f118/66d60c4fd2a74ce48cc4a11854028cbd/FLAGfa242c660 [2025-02-06 03:19:02,393 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:19:02,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2025-02-06 03:19:02,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1bcc6f118/66d60c4fd2a74ce48cc4a11854028cbd/FLAGfa242c660 [2025-02-06 03:19:02,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1bcc6f118/66d60c4fd2a74ce48cc4a11854028cbd [2025-02-06 03:19:02,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:19:02,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:19:02,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:19:02,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:19:02,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:19:02,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38784a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02, skipping insertion in model container [2025-02-06 03:19:02,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:19:02,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2025-02-06 03:19:02,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:19:02,658 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:19:02,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2025-02-06 03:19:02,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:19:02,712 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:19:02,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02 WrapperNode [2025-02-06 03:19:02,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:19:02,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:19:02,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:19:02,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:19:02,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,776 INFO L138 Inliner]: procedures = 29, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 406 [2025-02-06 03:19:02,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:19:02,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:19:02,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:19:02,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:19:02,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,820 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2025-02-06 03:19:02,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:19:02,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:19:02,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:19:02,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:19:02,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (1/1) ... [2025-02-06 03:19:02,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:19:02,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:02,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:19:02,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:19:02,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:19:02,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:19:02,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:19:02,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:19:02,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:19:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:19:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:19:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:19:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:19:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:19:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:19:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:19:02,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:19:02,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:19:03,013 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:19:03,015 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:19:03,293 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~ite62#1;havoc property_#t~mem61#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~bitwise65#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem70#1;havoc property_#t~mem67#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~short74#1;havoc property_#t~mem75#1;havoc property_#t~ite96#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite95#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~short97#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short103#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~short106#1; [2025-02-06 03:19:03,319 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-02-06 03:19:03,319 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:19:03,328 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:19:03,328 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:19:03,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:03 BoogieIcfgContainer [2025-02-06 03:19:03,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:19:03,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:19:03,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:19:03,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:19:03,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:19:02" (1/3) ... [2025-02-06 03:19:03,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497f9c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:03, skipping insertion in model container [2025-02-06 03:19:03,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:02" (2/3) ... [2025-02-06 03:19:03,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497f9c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:03, skipping insertion in model container [2025-02-06 03:19:03,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:03" (3/3) ... [2025-02-06 03:19:03,334 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-67.i [2025-02-06 03:19:03,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:19:03,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-67.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:19:03,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:19:03,381 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;@eba6b5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:19:03,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:19:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:19:03,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:03,391 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:03,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:03,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1129971590, now seen corresponding path program 1 times [2025-02-06 03:19:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:03,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920125160] [2025-02-06 03:19:03,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:03,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:19:03,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:19:03,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:03,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 03:19:03,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:03,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920125160] [2025-02-06 03:19:03,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920125160] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:19:03,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184514898] [2025-02-06 03:19:03,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:03,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:03,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:03,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:19:03,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:19:03,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:19:03,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:19:03,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:03,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:03,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:19:03,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 03:19:03,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:03,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184514898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:03,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:19:03,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:19:03,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491000964] [2025-02-06 03:19:03,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:03,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:19:03,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:03,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:19:03,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:19:03,920 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:03,939 INFO L93 Difference]: Finished difference Result 178 states and 269 transitions. [2025-02-06 03:19:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:19:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-02-06 03:19:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:03,946 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:19:03,946 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:19:03,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-02-06 03:19:03,950 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:03,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:03,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:19:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:19:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2025-02-06 03:19:03,978 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2025-02-06 03:19:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:03,979 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-02-06 03:19:03,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2025-02-06 03:19:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:19:03,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:03,981 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:03,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:19:04,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:19:04,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:04,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1519498174, now seen corresponding path program 1 times [2025-02-06 03:19:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:04,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331241979] [2025-02-06 03:19:04,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:19:04,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:19:04,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:04,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:04,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:04,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331241979] [2025-02-06 03:19:04,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331241979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:04,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:04,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:19:04,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881460839] [2025-02-06 03:19:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:04,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:19:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:04,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:19:04,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:04,507 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:04,583 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2025-02-06 03:19:04,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:19:04,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-02-06 03:19:04,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:04,585 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:19:04,585 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 03:19:04,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:04,586 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:04,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 352 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 03:19:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-02-06 03:19:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-02-06 03:19:04,610 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2025-02-06 03:19:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:04,614 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-02-06 03:19:04,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-02-06 03:19:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:19:04,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:04,615 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:04,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:19:04,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:04,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:04,615 INFO L85 PathProgramCache]: Analyzing trace with hash -287956289, now seen corresponding path program 1 times [2025-02-06 03:19:04,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288692664] [2025-02-06 03:19:04,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:04,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:19:04,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:19:04,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:04,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:04,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:04,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288692664] [2025-02-06 03:19:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288692664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:04,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:19:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099629488] [2025-02-06 03:19:04,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:04,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:19:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:19:04,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:04,850 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:04,883 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2025-02-06 03:19:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:19:04,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-02-06 03:19:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:04,884 INFO L225 Difference]: With dead ends: 182 [2025-02-06 03:19:04,884 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:19:04,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:04,885 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:04,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 353 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:19:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-02-06 03:19:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-02-06 03:19:04,891 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2025-02-06 03:19:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:04,891 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-02-06 03:19:04,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-02-06 03:19:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:19:04,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:04,893 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:04,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:19:04,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:04,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash 599547392, now seen corresponding path program 1 times [2025-02-06 03:19:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343388997] [2025-02-06 03:19:04,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:04,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:19:04,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:19:04,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:04,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:05,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:05,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343388997] [2025-02-06 03:19:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343388997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:05,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:05,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:19:05,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798769919] [2025-02-06 03:19:05,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:05,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:19:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:05,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:19:05,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:05,007 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:05,038 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2025-02-06 03:19:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:19:05,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-02-06 03:19:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:05,040 INFO L225 Difference]: With dead ends: 186 [2025-02-06 03:19:05,040 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 03:19:05,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:05,041 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:05,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 355 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 03:19:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-02-06 03:19:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-02-06 03:19:05,054 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2025-02-06 03:19:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:05,054 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-02-06 03:19:05,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-02-06 03:19:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:19:05,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:05,058 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:05,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:19:05,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:05,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash 600470913, now seen corresponding path program 1 times [2025-02-06 03:19:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882902789] [2025-02-06 03:19:05,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:05,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:19:05,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:19:05,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:05,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:07,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:07,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882902789] [2025-02-06 03:19:07,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882902789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:07,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:07,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:19:07,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321343444] [2025-02-06 03:19:07,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:07,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:19:07,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:07,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:19:07,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:19:07,785 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:19:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:08,724 INFO L93 Difference]: Finished difference Result 346 states and 479 transitions. [2025-02-06 03:19:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:19:08,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-02-06 03:19:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:08,726 INFO L225 Difference]: With dead ends: 346 [2025-02-06 03:19:08,726 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 03:19:08,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:19:08,727 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 433 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:08,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1077 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:19:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 03:19:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 189. [2025-02-06 03:19:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 168 states have internal predecessors, (227), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:19:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 263 transitions. [2025-02-06 03:19:08,740 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 263 transitions. Word has length 104 [2025-02-06 03:19:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:08,740 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 263 transitions. [2025-02-06 03:19:08,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 03:19:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 263 transitions. [2025-02-06 03:19:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:19:08,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:08,742 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:08,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:19:08,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:08,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1845235394, now seen corresponding path program 1 times [2025-02-06 03:19:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836819301] [2025-02-06 03:19:08,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:08,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:08,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:19:08,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:19:08,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:08,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:08,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836819301] [2025-02-06 03:19:08,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836819301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:19:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756044426] [2025-02-06 03:19:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:08,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:19:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:08,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:19:08,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:19:08,794 INFO L87 Difference]: Start difference. First operand 189 states and 263 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:08,817 INFO L93 Difference]: Finished difference Result 413 states and 572 transitions. [2025-02-06 03:19:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:19:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-02-06 03:19:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:08,819 INFO L225 Difference]: With dead ends: 413 [2025-02-06 03:19:08,819 INFO L226 Difference]: Without dead ends: 227 [2025-02-06 03:19:08,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-02-06 03:19:08,820 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 61 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:08,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 309 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-06 03:19:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 187. [2025-02-06 03:19:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 165 states have (on average 1.3515151515151516) internal successors, (223), 166 states have internal predecessors, (223), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:19:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 259 transitions. [2025-02-06 03:19:08,832 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 259 transitions. Word has length 104 [2025-02-06 03:19:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:08,832 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 259 transitions. [2025-02-06 03:19:08,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 259 transitions. [2025-02-06 03:19:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:19:08,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:08,833 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:08,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:19:08,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:08,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:08,834 INFO L85 PathProgramCache]: Analyzing trace with hash -303323569, now seen corresponding path program 1 times [2025-02-06 03:19:08,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:08,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-02-06 03:19:08,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:08,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:08,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:19:08,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:19:08,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:08,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:09,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:09,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-02-06 03:19:09,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595382007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:09,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:09,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044939306] [2025-02-06 03:19:09,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:09,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:09,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:09,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:09,510 INFO L87 Difference]: Start difference. First operand 187 states and 259 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:09,689 INFO L93 Difference]: Finished difference Result 396 states and 547 transitions. [2025-02-06 03:19:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:09,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-02-06 03:19:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:09,691 INFO L225 Difference]: With dead ends: 396 [2025-02-06 03:19:09,691 INFO L226 Difference]: Without dead ends: 212 [2025-02-06 03:19:09,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:19:09,692 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 92 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:09,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 621 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-06 03:19:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 174. [2025-02-06 03:19:09,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 153 states have internal predecessors, (202), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:19:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 238 transitions. [2025-02-06 03:19:09,707 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 238 transitions. Word has length 105 [2025-02-06 03:19:09,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:09,707 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 238 transitions. [2025-02-06 03:19:09,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 238 transitions. [2025-02-06 03:19:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 03:19:09,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:09,712 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:09,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:19:09,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:09,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash 816444602, now seen corresponding path program 1 times [2025-02-06 03:19:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:09,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-02-06 03:19:09,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:09,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 03:19:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 03:19:09,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:09,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:10,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410014047] [2025-02-06 03:19:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410014047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:10,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:10,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396202009] [2025-02-06 03:19:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:10,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:10,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:10,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:10,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:10,313 INFO L87 Difference]: Start difference. First operand 174 states and 238 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:10,575 INFO L93 Difference]: Finished difference Result 504 states and 689 transitions. [2025-02-06 03:19:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:10,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-02-06 03:19:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:10,578 INFO L225 Difference]: With dead ends: 504 [2025-02-06 03:19:10,578 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 03:19:10,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:19:10,579 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 97 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:10,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 824 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:19:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 03:19:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2025-02-06 03:19:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 289 states have (on average 1.3217993079584776) internal successors, (382), 292 states have internal predecessors, (382), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:19:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 450 transitions. [2025-02-06 03:19:10,620 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 450 transitions. Word has length 108 [2025-02-06 03:19:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:10,620 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 450 transitions. [2025-02-06 03:19:10,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 450 transitions. [2025-02-06 03:19:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:19:10,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:10,622 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:10,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:19:10,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:10,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1188956, now seen corresponding path program 1 times [2025-02-06 03:19:10,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:10,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907479667] [2025-02-06 03:19:10,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:10,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:10,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:19:10,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:19:10,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:10,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:10,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:10,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907479667] [2025-02-06 03:19:10,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907479667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:10,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:10,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:19:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971398397] [2025-02-06 03:19:10,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:10,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:19:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:10,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:19:10,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:19:10,808 INFO L87 Difference]: Start difference. First operand 330 states and 450 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:11,052 INFO L93 Difference]: Finished difference Result 816 states and 1115 transitions. [2025-02-06 03:19:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:11,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-02-06 03:19:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:11,055 INFO L225 Difference]: With dead ends: 816 [2025-02-06 03:19:11,055 INFO L226 Difference]: Without dead ends: 489 [2025-02-06 03:19:11,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:19:11,056 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 98 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:11,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 906 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:19:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-06 03:19:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 361. [2025-02-06 03:19:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 320 states have (on average 1.340625) internal successors, (429), 323 states have internal predecessors, (429), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:19:11,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 497 transitions. [2025-02-06 03:19:11,078 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 497 transitions. Word has length 110 [2025-02-06 03:19:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:11,078 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 497 transitions. [2025-02-06 03:19:11,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 497 transitions. [2025-02-06 03:19:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:19:11,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:11,079 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:11,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:19:11,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:11,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:11,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1730174468, now seen corresponding path program 1 times [2025-02-06 03:19:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:11,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-02-06 03:19:11,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:11,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:11,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:19:11,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:19:11,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:11,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493820630] [2025-02-06 03:19:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493820630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:11,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:11,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:19:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027634055] [2025-02-06 03:19:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:11,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:19:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:11,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:19:11,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:19:11,216 INFO L87 Difference]: Start difference. First operand 361 states and 497 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:11,453 INFO L93 Difference]: Finished difference Result 860 states and 1181 transitions. [2025-02-06 03:19:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:11,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-02-06 03:19:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:11,456 INFO L225 Difference]: With dead ends: 860 [2025-02-06 03:19:11,456 INFO L226 Difference]: Without dead ends: 502 [2025-02-06 03:19:11,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:19:11,457 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 88 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:11,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 884 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:19:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-06 03:19:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 387. [2025-02-06 03:19:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 346 states have (on average 1.3497109826589595) internal successors, (467), 349 states have internal predecessors, (467), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:19:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 535 transitions. [2025-02-06 03:19:11,480 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 535 transitions. Word has length 110 [2025-02-06 03:19:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:11,480 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 535 transitions. [2025-02-06 03:19:11,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 535 transitions. [2025-02-06 03:19:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:19:11,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:11,482 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:11,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:19:11,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:11,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:11,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1445789014, now seen corresponding path program 1 times [2025-02-06 03:19:11,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:11,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989698417] [2025-02-06 03:19:11,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:11,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:19:11,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:19:11,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:11,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:11,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:11,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989698417] [2025-02-06 03:19:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989698417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:11,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207920021] [2025-02-06 03:19:11,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:11,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:19:11,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:11,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:19:11,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:11,580 INFO L87 Difference]: Start difference. First operand 387 states and 535 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:11,704 INFO L93 Difference]: Finished difference Result 888 states and 1218 transitions. [2025-02-06 03:19:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:19:11,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-02-06 03:19:11,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:11,707 INFO L225 Difference]: With dead ends: 888 [2025-02-06 03:19:11,707 INFO L226 Difference]: Without dead ends: 504 [2025-02-06 03:19:11,708 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-02-06 03:19:11,708 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 88 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:11,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 556 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-02-06 03:19:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 274. [2025-02-06 03:19:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 245 states have (on average 1.3551020408163266) internal successors, (332), 246 states have internal predecessors, (332), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:19:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 376 transitions. [2025-02-06 03:19:11,727 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 376 transitions. Word has length 111 [2025-02-06 03:19:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:11,727 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 376 transitions. [2025-02-06 03:19:11,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 376 transitions. [2025-02-06 03:19:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-06 03:19:11,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:11,728 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:11,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:19:11,728 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:11,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1642991557, now seen corresponding path program 1 times [2025-02-06 03:19:11,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:11,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442824898] [2025-02-06 03:19:11,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:11,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 03:19:11,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 03:19:11,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:11,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:19:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442824898] [2025-02-06 03:19:11,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442824898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:11,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:11,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:11,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372052660] [2025-02-06 03:19:11,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:11,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:19:11,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:19:11,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:19:11,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:11,816 INFO L87 Difference]: Start difference. First operand 274 states and 376 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:11,935 INFO L93 Difference]: Finished difference Result 650 states and 889 transitions. [2025-02-06 03:19:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:19:11,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-02-06 03:19:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:11,937 INFO L225 Difference]: With dead ends: 650 [2025-02-06 03:19:11,937 INFO L226 Difference]: Without dead ends: 379 [2025-02-06 03:19:11,937 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-02-06 03:19:11,938 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 85 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:11,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 536 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-02-06 03:19:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 273. [2025-02-06 03:19:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 244 states have (on average 1.348360655737705) internal successors, (329), 245 states have internal predecessors, (329), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 03:19:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 373 transitions. [2025-02-06 03:19:11,963 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 373 transitions. Word has length 111 [2025-02-06 03:19:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:11,963 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 373 transitions. [2025-02-06 03:19:11,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 373 transitions. [2025-02-06 03:19:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 03:19:11,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:11,965 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:11,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:19:11,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:11,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash 745331629, now seen corresponding path program 1 times [2025-02-06 03:19:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:19:11,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376539897] [2025-02-06 03:19:11,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:19:11,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:19:12,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:19:12,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:12,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:19:12,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668573954] [2025-02-06 03:19:12,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:12,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:12,026 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:19:12,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:19:12,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:19:12,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:19:12,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:12,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:19:12,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:19:12,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 03:19:12,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 03:19:12,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:12,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:19:12,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:19:12,819 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:19:12,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:19:12,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:19:13,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:19:13,025 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:19:13,092 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:19:13,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:19:13 BoogieIcfgContainer [2025-02-06 03:19:13,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:19:13,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:19:13,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:19:13,096 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:19:13,097 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:03" (3/4) ... [2025-02-06 03:19:13,098 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:19:13,099 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:19:13,100 INFO L158 Benchmark]: Toolchain (without parser) took 10686.13ms. Allocated memory was 536.9MB in the beginning and 486.5MB in the end (delta: -50.3MB). Free memory was 492.9MB in the beginning and 421.1MB in the end (delta: 71.8MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2025-02-06 03:19:13,100 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:19:13,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.56ms. Allocated memory was 536.9MB in the beginning and 167.8MB in the end (delta: -369.1MB). Free memory was 492.9MB in the beginning and 109.8MB in the end (delta: 383.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:19:13,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.38ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 106.1MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:19:13,100 INFO L158 Benchmark]: Boogie Preprocessor took 72.43ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 102.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:19:13,101 INFO L158 Benchmark]: IcfgBuilder took 474.62ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 71.3MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:19:13,101 INFO L158 Benchmark]: TraceAbstraction took 9764.50ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 70.7MB in the beginning and 421.2MB in the end (delta: -350.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:19:13,101 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 486.5MB. Free memory was 421.2MB in the beginning and 421.1MB in the end (delta: 99.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:19:13,102 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.56ms. Allocated memory was 536.9MB in the beginning and 167.8MB in the end (delta: -369.1MB). Free memory was 492.9MB in the beginning and 109.8MB in the end (delta: 383.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.38ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 106.1MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.43ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 102.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 474.62ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 71.3MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9764.50ms. Allocated memory was 167.8MB in the beginning and 486.5MB in the end (delta: 318.8MB). Free memory was 70.7MB in the beginning and 421.2MB in the end (delta: -350.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 486.5MB. Free memory was 421.2MB in the beginning and 421.1MB in the end (delta: 99.2kB). Peak memory consumption was 8.4MB. 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 shiftRight at line 100, overapproximation of shiftRight at line 50, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[1] = { 25.875 }; [L25-L27] double double_Array_0[1] = { 25.875 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L40] signed long int last_1_signed_long_int_Array_0_1_ = 50; [L41] signed short int last_1_signed_short_int_Array_0_2_ = 2; [L42] unsigned short int last_1_unsigned_short_int_Array_0_2_ = 128; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L95] EXPR signed_long_int_Array_0[1] [L95] last_1_signed_long_int_Array_0_1_ = signed_long_int_Array_0[1] [L96] EXPR signed_short_int_Array_0[2] [L96] last_1_signed_short_int_Array_0_2_ = signed_short_int_Array_0[2] [L97] EXPR unsigned_short_int_Array_0[2] [L97] last_1_unsigned_short_int_Array_0_2_ = unsigned_short_int_Array_0[2] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] float_Array_0[0] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L85] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L108] RET updateVariables() [L109] CALL step() [L46] COND TRUE ! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_) [L47] EXPR signed_short_int_Array_0[1] [L47] EXPR signed_short_int_Array_0[0] [L47] signed_short_int_Array_0[2] = (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]) [L49] EXPR signed_short_int_Array_0[1] [L49] signed long int stepLocal_0 = 1 * signed_short_int_Array_0[1]; [L50] EXPR signed_short_int_Array_0[2] [L50] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=-16190, unsigned_short_int_Array_0={9:0}] [L50] COND TRUE (signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > stepLocal_0 [L51] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] EXPR (((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0) [L51] EXPR unsigned_short_int_Array_0[0] [L51] EXPR (((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] unsigned_short_int_Array_0[2] = (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))) [L55] EXPR float_Array_0[0] [L55] float_Array_0[1] = float_Array_0[0] [L56] EXPR float_Array_0[0] [L56] double_Array_0[0] = float_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[0] [L57] unsigned_short_int_Array_0[1] = unsigned_short_int_Array_0[0] [L58] EXPR signed_short_int_Array_0[1] [L58] EXPR signed_long_int_Array_0[0] [L58] signed long int stepLocal_2 = signed_short_int_Array_0[1] / signed_long_int_Array_0[0]; [L59] EXPR unsigned_short_int_Array_0[0] [L59] unsigned short int stepLocal_1 = unsigned_short_int_Array_0[0]; [L60] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L60] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L63] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(unsigned_short_int_Array_0[1] > stepLocal_2) [L70] EXPR unsigned_short_int_Array_0[2] [L70] EXPR signed_short_int_Array_0[0] [L70] signed_long_int_Array_0[1] = (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR signed_short_int_Array_0[0] [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L100] EXPR unsigned_short_int_Array_0[2] [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100-L101] return ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1048 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1045 mSDsluCounter, 6897 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5101 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1620 IncrementalHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 1796 mSDtfsCounter, 1620 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=10, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 728 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1607 NumberOfCodeBlocks, 1607 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1370 ConstructedInterpolants, 0 QuantifiedInterpolants, 5084 SizeOfPredicates, 0 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 3410/3432 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-02-06 03:19:13,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:19:15,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:19:15,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:19:15,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:19:15,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:19:15,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:19:15,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:19:15,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:19:15,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:19:15,180 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:19:15,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:19:15,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:19:15,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:19:15,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:19:15,180 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:19:15,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:19:15,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:19:15,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:19:15,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:19:15,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:19:15,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:19:15,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:19:15,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:19:15,181 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:19:15,181 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:19:15,182 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:19:15,182 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:19:15,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:19:15,182 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:19:15,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:19:15,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:19:15,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:19:15,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:19:15,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:19:15,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:19:15,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:19:15,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:19:15,183 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:19:15,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:19:15,183 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:19:15,183 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:19:15,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:19:15,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:19:15,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:19:15,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:19:15,183 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-jdk21/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 -> 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca [2025-02-06 03:19:15,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:19:15,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:19:15,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:19:15,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:19:15,519 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:19:15,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2025-02-06 03:19:16,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83d8bacaa/50d5cbd29f904ba8a43c1aba652c3f29/FLAGab7a4ae7c [2025-02-06 03:19:16,972 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:19:16,973 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2025-02-06 03:19:16,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83d8bacaa/50d5cbd29f904ba8a43c1aba652c3f29/FLAGab7a4ae7c [2025-02-06 03:19:16,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83d8bacaa/50d5cbd29f904ba8a43c1aba652c3f29 [2025-02-06 03:19:16,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:19:16,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:19:16,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:19:16,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:19:17,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:19:17,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:19:16" (1/1) ... [2025-02-06 03:19:17,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbd53e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17, skipping insertion in model container [2025-02-06 03:19:17,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:19:16" (1/1) ... [2025-02-06 03:19:17,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:19:17,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2025-02-06 03:19:17,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:19:17,201 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:19:17,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2025-02-06 03:19:17,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:19:17,273 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:19:17,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17 WrapperNode [2025-02-06 03:19:17,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:19:17,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:19:17,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:19:17,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:19:17,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,314 INFO L138 Inliner]: procedures = 39, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 389 [2025-02-06 03:19:17,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:19:17,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:19:17,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:19:17,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:19:17,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,340 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2025-02-06 03:19:17,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:19:17,364 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:19:17,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:19:17,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:19:17,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (1/1) ... [2025-02-06 03:19:17,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:19:17,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:19:17,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:19:17,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:19:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:19:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:19:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-02-06 03:19:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:19:17,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:19:17,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:19:17,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:19:17,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:19:17,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:19:17,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:19:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:19:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:19:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:19:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:19:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:19:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:19:17,539 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:19:17,540 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:19:18,100 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~ite61#1;havoc property_#t~mem60#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~ite71#1;havoc property_#t~mem68#1;havoc property_#t~mem65#1;havoc property_#t~ite67#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~short72#1;havoc property_#t~mem73#1;havoc property_#t~ite94#1;havoc property_#t~mem77#1;havoc property_#t~mem74#1;havoc property_#t~ite76#1;havoc property_#t~mem75#1;havoc property_#t~mem80#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite93#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem83#1;havoc property_#t~ite85#1;havoc property_#t~mem84#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short95#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short98#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short101#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short104#1; [2025-02-06 03:19:18,156 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-02-06 03:19:18,156 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:19:18,162 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:19:18,162 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:19:18,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:18 BoogieIcfgContainer [2025-02-06 03:19:18,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:19:18,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:19:18,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:19:18,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:19:18,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:19:16" (1/3) ... [2025-02-06 03:19:18,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3855ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:18, skipping insertion in model container [2025-02-06 03:19:18,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:19:17" (2/3) ... [2025-02-06 03:19:18,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3855ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:19:18, skipping insertion in model container [2025-02-06 03:19:18,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:19:18" (3/3) ... [2025-02-06 03:19:18,168 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-67.i [2025-02-06 03:19:18,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:19:18,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-67.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:19:18,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:19:18,213 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;@4919768d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:19:18,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:19:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:19:18,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:18,226 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:18,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1504586512, now seen corresponding path program 1 times [2025-02-06 03:19:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:18,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472464326] [2025-02-06 03:19:18,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:18,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:18,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:18,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:18,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:18,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:19:18,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:19:18,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:18,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:18,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:19:18,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-02-06 03:19:18,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:18,619 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:18,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472464326] [2025-02-06 03:19:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472464326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:18,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:18,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:19:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886205421] [2025-02-06 03:19:18,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:18,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:19:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:18,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:19:18,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:19:18,640 INFO L87 Difference]: Start difference. First operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:18,659 INFO L93 Difference]: Finished difference Result 168 states and 255 transitions. [2025-02-06 03:19:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:19:18,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-02-06 03:19:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:18,663 INFO L225 Difference]: With dead ends: 168 [2025-02-06 03:19:18,663 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 03:19:18,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-02-06 03:19:18,667 INFO L435 NwaCegarLoop]: 119 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, 119 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-02-06 03:19:18,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 03:19:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-06 03:19:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-02-06 03:19:18,689 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2025-02-06 03:19:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:18,689 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-02-06 03:19:18,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-02-06 03:19:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:19:18,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:18,691 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:18,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:18,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:18,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:18,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -283963432, now seen corresponding path program 1 times [2025-02-06 03:19:18,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:18,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339733935] [2025-02-06 03:19:18,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:18,897 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-02-06 03:19:18,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:18,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:18,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:19,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:19:19,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:19:19,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:19,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:19,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:19:19,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:19,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:19,258 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339733935] [2025-02-06 03:19:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339733935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:19,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:19,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843175885] [2025-02-06 03:19:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:19,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:19:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:19,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:19:19,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:19,262 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:19,329 INFO L93 Difference]: Finished difference Result 170 states and 242 transitions. [2025-02-06 03:19:19,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:19:19,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-02-06 03:19:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:19,331 INFO L225 Difference]: With dead ends: 170 [2025-02-06 03:19:19,331 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:19:19,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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-02-06 03:19:19,332 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 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-02-06 03:19:19,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:19:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-02-06 03:19:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-02-06 03:19:19,338 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 103 [2025-02-06 03:19:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:19,339 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-02-06 03:19:19,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-02-06 03:19:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:19:19,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:19,341 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:19,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:19,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:19,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:19,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2091417895, now seen corresponding path program 1 times [2025-02-06 03:19:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951721327] [2025-02-06 03:19:19,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:19,546 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-02-06 03:19:19,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:19,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:19,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:19,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:19:19,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:19:19,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:19,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:19,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:19:19,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:19,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:19,827 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951721327] [2025-02-06 03:19:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951721327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:19,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949028923] [2025-02-06 03:19:19,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:19,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:19,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:19,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:19,832 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:19,941 INFO L93 Difference]: Finished difference Result 176 states and 247 transitions. [2025-02-06 03:19:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:19:19,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-02-06 03:19:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:19,942 INFO L225 Difference]: With dead ends: 176 [2025-02-06 03:19:19,942 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:19:19,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 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-02-06 03:19:19,943 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 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.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:19,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:19:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-02-06 03:19:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2025-02-06 03:19:19,949 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2025-02-06 03:19:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:19,949 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2025-02-06 03:19:19,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2025-02-06 03:19:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:19:19,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:19,951 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:19,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:19:20,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:20,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1203914214, now seen corresponding path program 1 times [2025-02-06 03:19:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461754665] [2025-02-06 03:19:20,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:20,156 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-02-06 03:19:20,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:20,159 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:20,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:20,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:19:20,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:19:20,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:20,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:20,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:19:20,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:20,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:20,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:20,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461754665] [2025-02-06 03:19:20,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461754665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:20,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:20,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:20,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349964171] [2025-02-06 03:19:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:20,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:20,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:20,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:20,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:20,502 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:20,633 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2025-02-06 03:19:20,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:20,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-02-06 03:19:20,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:20,634 INFO L225 Difference]: With dead ends: 180 [2025-02-06 03:19:20,634 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 03:19:20,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:20,635 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:20,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 03:19:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-02-06 03:19:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 03:19:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2025-02-06 03:19:20,644 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2025-02-06 03:19:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:20,644 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2025-02-06 03:19:20,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2025-02-06 03:19:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:19:20,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:20,646 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:20,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:20,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:20,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1202990693, now seen corresponding path program 1 times [2025-02-06 03:19:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:20,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100144793] [2025-02-06 03:19:20,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:20,847 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-02-06 03:19:20,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:20,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:20,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:20,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:19:21,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:19:21,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:21,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:21,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:19:21,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:21,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:19:21,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-02-06 03:19:21,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:21,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 72 treesize of output 54 [2025-02-06 03:19:22,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:22,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 80 [2025-02-06 03:19:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 170 proven. 24 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-06 03:19:22,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:19:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:22,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100144793] [2025-02-06 03:19:22,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100144793] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:19:22,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:19:22,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 27 [2025-02-06 03:19:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327333764] [2025-02-06 03:19:22,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:22,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:22,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:22,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:22,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-02-06 03:19:22,393 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:22,823 INFO L93 Difference]: Finished difference Result 279 states and 386 transitions. [2025-02-06 03:19:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:22,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-02-06 03:19:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:22,829 INFO L225 Difference]: With dead ends: 279 [2025-02-06 03:19:22,831 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 03:19:22,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:19:22,832 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 253 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:22,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 613 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:19:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 03:19:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 164. [2025-02-06 03:19:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 144 states have internal predecessors, (191), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:19:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2025-02-06 03:19:22,847 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 103 [2025-02-06 03:19:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:22,847 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2025-02-06 03:19:22,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2025-02-06 03:19:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:19:22,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:22,849 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:22,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:19:23,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:23,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:23,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1053920314, now seen corresponding path program 1 times [2025-02-06 03:19:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:23,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462708547] [2025-02-06 03:19:23,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:23,053 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-02-06 03:19:23,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:23,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:23,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:23,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:19:23,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:19:23,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:23,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:23,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:19:23,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:23,345 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 21 treesize of output 9 [2025-02-06 03:19:23,351 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 21 treesize of output 9 [2025-02-06 03:19:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:23,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:23,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:23,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462708547] [2025-02-06 03:19:23,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462708547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:23,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:23,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:19:23,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089216692] [2025-02-06 03:19:23,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:23,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:19:23,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:23,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:19:23,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:23,636 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:23,887 INFO L93 Difference]: Finished difference Result 417 states and 576 transitions. [2025-02-06 03:19:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:19:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-02-06 03:19:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:23,889 INFO L225 Difference]: With dead ends: 417 [2025-02-06 03:19:23,889 INFO L226 Difference]: Without dead ends: 256 [2025-02-06 03:19:23,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:23,892 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 93 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:23,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 301 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:19:23,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-06 03:19:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2025-02-06 03:19:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 184 states have (on average 1.315217391304348) internal successors, (242), 185 states have internal predecessors, (242), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:19:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 302 transitions. [2025-02-06 03:19:23,910 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 302 transitions. Word has length 103 [2025-02-06 03:19:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:23,911 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 302 transitions. [2025-02-06 03:19:23,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 302 transitions. [2025-02-06 03:19:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 03:19:23,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:23,912 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:23,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:24,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:24,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:24,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:24,113 INFO L85 PathProgramCache]: Analyzing trace with hash 452235317, now seen corresponding path program 1 times [2025-02-06 03:19:24,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:24,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547763400] [2025-02-06 03:19:24,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:24,114 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-02-06 03:19:24,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:24,115 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:24,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:24,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 03:19:24,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 03:19:24,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:24,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:24,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 03:19:24,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:24,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 03:19:25,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:19:25,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 52 treesize of output 24 [2025-02-06 03:19:25,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2025-02-06 03:19:25,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:25,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 38 [2025-02-06 03:19:25,667 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 50 treesize of output 26 [2025-02-06 03:19:25,674 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 21 treesize of output 13 [2025-02-06 03:19:27,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:27,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 46 [2025-02-06 03:19:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 199 proven. 15 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-06 03:19:27,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:19:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:28,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:28,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547763400] [2025-02-06 03:19:28,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547763400] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:19:28,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:19:28,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [26] total 31 [2025-02-06 03:19:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761167253] [2025-02-06 03:19:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:28,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:19:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:28,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:19:28,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:19:28,851 INFO L87 Difference]: Start difference. First operand 219 states and 302 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:30,160 INFO L93 Difference]: Finished difference Result 547 states and 755 transitions. [2025-02-06 03:19:30,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:30,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-02-06 03:19:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:30,162 INFO L225 Difference]: With dead ends: 547 [2025-02-06 03:19:30,162 INFO L226 Difference]: Without dead ends: 386 [2025-02-06 03:19:30,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 03:19:30,163 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 273 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:30,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 825 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:19:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-02-06 03:19:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2025-02-06 03:19:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 329 states have (on average 1.3221884498480243) internal successors, (435), 332 states have internal predecessors, (435), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:19:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 527 transitions. [2025-02-06 03:19:30,179 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 527 transitions. Word has length 105 [2025-02-06 03:19:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:30,179 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 527 transitions. [2025-02-06 03:19:30,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 527 transitions. [2025-02-06 03:19:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:19:30,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:30,180 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:30,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:30,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:30,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:30,386 INFO L85 PathProgramCache]: Analyzing trace with hash -609429193, now seen corresponding path program 1 times [2025-02-06 03:19:30,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:30,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990886040] [2025-02-06 03:19:30,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:30,386 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-02-06 03:19:30,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:30,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:30,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:30,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:19:30,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:19:30,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:30,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:30,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:19:30,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:30,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:30,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 24 [2025-02-06 03:19:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:30,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:30,807 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:30,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990886040] [2025-02-06 03:19:30,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990886040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:30,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:30,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:19:30,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607735410] [2025-02-06 03:19:30,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:30,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:19:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:30,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:19:30,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:19:30,809 INFO L87 Difference]: Start difference. First operand 383 states and 527 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:32,006 INFO L93 Difference]: Finished difference Result 700 states and 962 transitions. [2025-02-06 03:19:32,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:19:32,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-02-06 03:19:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:32,009 INFO L225 Difference]: With dead ends: 700 [2025-02-06 03:19:32,009 INFO L226 Difference]: Without dead ends: 389 [2025-02-06 03:19:32,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:32,011 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 84 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:32,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 537 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:19:32,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-06 03:19:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 331. [2025-02-06 03:19:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 283 states have (on average 1.3180212014134276) internal successors, (373), 285 states have internal predecessors, (373), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:19:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 453 transitions. [2025-02-06 03:19:32,031 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 453 transitions. Word has length 107 [2025-02-06 03:19:32,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:32,031 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 453 transitions. [2025-02-06 03:19:32,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 453 transitions. [2025-02-06 03:19:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 03:19:32,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:32,032 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:32,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:19:32,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:32,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:32,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash 452020919, now seen corresponding path program 1 times [2025-02-06 03:19:32,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:32,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370211279] [2025-02-06 03:19:32,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:32,234 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-02-06 03:19:32,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:32,238 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:32,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:32,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 03:19:32,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 03:19:32,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:32,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:32,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 03:19:32,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:32,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:32,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 38 [2025-02-06 03:19:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:32,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:32,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:32,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370211279] [2025-02-06 03:19:32,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370211279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:32,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:32,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:32,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691266179] [2025-02-06 03:19:32,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:32,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:32,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:32,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:32,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:32,881 INFO L87 Difference]: Start difference. First operand 331 states and 453 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:34,305 INFO L93 Difference]: Finished difference Result 600 states and 820 transitions. [2025-02-06 03:19:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:34,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-02-06 03:19:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:34,307 INFO L225 Difference]: With dead ends: 600 [2025-02-06 03:19:34,307 INFO L226 Difference]: Without dead ends: 341 [2025-02-06 03:19:34,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:19:34,308 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 86 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:34,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 700 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:19:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-02-06 03:19:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 279. [2025-02-06 03:19:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 237 states have (on average 1.3164556962025316) internal successors, (312), 238 states have internal predecessors, (312), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:19:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 380 transitions. [2025-02-06 03:19:34,326 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 380 transitions. Word has length 107 [2025-02-06 03:19:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:34,327 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 380 transitions. [2025-02-06 03:19:34,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 380 transitions. [2025-02-06 03:19:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:19:34,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:34,329 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:34,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:34,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:34,533 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:34,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:34,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1900324039, now seen corresponding path program 1 times [2025-02-06 03:19:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:34,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371274943] [2025-02-06 03:19:34,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:34,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:19:34,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:34,536 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:34,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:34,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:19:34,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:19:34,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:34,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:34,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:19:34,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:34,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:19:34,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 28 [2025-02-06 03:19:34,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:34,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 43 [2025-02-06 03:19:35,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:35,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 34 [2025-02-06 03:19:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-06 03:19:35,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:35,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:35,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371274943] [2025-02-06 03:19:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371274943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:35,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:35,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:19:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436959976] [2025-02-06 03:19:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:35,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:19:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:35,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:19:35,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:19:35,113 INFO L87 Difference]: Start difference. First operand 279 states and 380 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:36,292 INFO L93 Difference]: Finished difference Result 598 states and 816 transitions. [2025-02-06 03:19:36,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:19:36,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-06 03:19:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:36,295 INFO L225 Difference]: With dead ends: 598 [2025-02-06 03:19:36,295 INFO L226 Difference]: Without dead ends: 391 [2025-02-06 03:19:36,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:19:36,296 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 270 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:36,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 991 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:19:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-06 03:19:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 319. [2025-02-06 03:19:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 277 states have (on average 1.339350180505415) internal successors, (371), 278 states have internal predecessors, (371), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:19:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 439 transitions. [2025-02-06 03:19:36,312 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 439 transitions. Word has length 109 [2025-02-06 03:19:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:36,312 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 439 transitions. [2025-02-06 03:19:36,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 439 transitions. [2025-02-06 03:19:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:19:36,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:36,313 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:36,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:36,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:36,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:36,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash -392772230, now seen corresponding path program 1 times [2025-02-06 03:19:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:36,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528830393] [2025-02-06 03:19:36,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:36,515 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-02-06 03:19:36,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:36,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:36,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:36,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:19:36,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:19:36,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:36,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:36,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:19:36,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:36,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:19:36,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 27 [2025-02-06 03:19:36,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:36,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 43 treesize of output 41 [2025-02-06 03:19:36,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:36,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 23 [2025-02-06 03:19:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:19:39,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:39,544 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528830393] [2025-02-06 03:19:39,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528830393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:39,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:39,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:39,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372760732] [2025-02-06 03:19:39,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:39,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:39,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:39,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=27, Unknown=1, NotChecked=0, Total=42 [2025-02-06 03:19:39,546 INFO L87 Difference]: Start difference. First operand 319 states and 439 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:42,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:43,220 INFO L93 Difference]: Finished difference Result 627 states and 856 transitions. [2025-02-06 03:19:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:43,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-02-06 03:19:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:43,222 INFO L225 Difference]: With dead ends: 627 [2025-02-06 03:19:43,222 INFO L226 Difference]: Without dead ends: 391 [2025-02-06 03:19:43,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=20, Invalid=35, Unknown=1, NotChecked=0, Total=56 [2025-02-06 03:19:43,224 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 135 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:43,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 762 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2025-02-06 03:19:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-02-06 03:19:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 323. [2025-02-06 03:19:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 280 states have (on average 1.332142857142857) internal successors, (373), 281 states have internal predecessors, (373), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:19:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 441 transitions. [2025-02-06 03:19:43,242 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 441 transitions. Word has length 109 [2025-02-06 03:19:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:43,243 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 441 transitions. [2025-02-06 03:19:43,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:19:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 441 transitions. [2025-02-06 03:19:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:19:43,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:43,244 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:43,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:43,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:43,445 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:43,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash 317433914, now seen corresponding path program 1 times [2025-02-06 03:19:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:43,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288420992] [2025-02-06 03:19:43,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:43,447 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-02-06 03:19:43,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:43,449 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:43,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:43,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:19:43,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:19:43,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:43,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:43,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:19:43,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:43,724 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 18 treesize of output 10 [2025-02-06 03:19:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-06 03:19:44,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:44,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:44,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288420992] [2025-02-06 03:19:44,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288420992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:44,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:44,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488661707] [2025-02-06 03:19:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:44,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:44,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:44,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:44,333 INFO L87 Difference]: Start difference. First operand 323 states and 441 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:46,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:48,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:51,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:53,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:54,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:56,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:19:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:56,740 INFO L93 Difference]: Finished difference Result 479 states and 651 transitions. [2025-02-06 03:19:56,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:19:56,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-06 03:19:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:56,742 INFO L225 Difference]: With dead ends: 479 [2025-02-06 03:19:56,742 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 03:19:56,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:19:56,743 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 98 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:56,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 365 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 222 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2025-02-06 03:19:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 03:19:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2025-02-06 03:19:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 190 states have (on average 1.305263157894737) internal successors, (248), 190 states have internal predecessors, (248), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:19:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 296 transitions. [2025-02-06 03:19:56,756 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 296 transitions. Word has length 109 [2025-02-06 03:19:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:56,756 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 296 transitions. [2025-02-06 03:19:56,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 296 transitions. [2025-02-06 03:19:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:19:56,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:56,757 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:56,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:56,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:56,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:56,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash 156295883, now seen corresponding path program 1 times [2025-02-06 03:19:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:56,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757042766] [2025-02-06 03:19:56,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:56,959 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-02-06 03:19:56,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:56,961 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:56,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:57,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:19:57,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:19:57,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:57,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:57,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 03:19:57,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:57,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:19:57,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 23 [2025-02-06 03:19:57,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:57,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 43 treesize of output 37 [2025-02-06 03:19:57,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:57,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 36 [2025-02-06 03:19:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-06 03:19:57,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:57,767 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:57,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757042766] [2025-02-06 03:19:57,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757042766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:57,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:57,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:19:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973624567] [2025-02-06 03:19:57,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:57,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:19:57,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:57,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:19:57,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:19:57,769 INFO L87 Difference]: Start difference. First operand 222 states and 296 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:58,926 INFO L93 Difference]: Finished difference Result 295 states and 388 transitions. [2025-02-06 03:19:58,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:19:58,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-06 03:19:58,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:58,928 INFO L225 Difference]: With dead ends: 295 [2025-02-06 03:19:58,928 INFO L226 Difference]: Without dead ends: 293 [2025-02-06 03:19:58,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:19:58,928 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 185 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:58,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 836 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 03:19:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-06 03:19:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 244. [2025-02-06 03:19:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 212 states have (on average 1.3113207547169812) internal successors, (278), 212 states have internal predecessors, (278), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:19:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 326 transitions. [2025-02-06 03:19:58,942 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 326 transitions. Word has length 109 [2025-02-06 03:19:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:58,943 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 326 transitions. [2025-02-06 03:19:58,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:19:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 326 transitions. [2025-02-06 03:19:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:19:58,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:58,943 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:58,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:59,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:59,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:59,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash 157219404, now seen corresponding path program 1 times [2025-02-06 03:19:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932539010] [2025-02-06 03:19:59,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:59,150 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-02-06 03:19:59,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:59,151 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:59,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:19:59,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:19:59,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:19:59,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:59,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:59,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:19:59,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:59,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:20:00,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-06 03:20:00,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 32 [2025-02-06 03:20:04,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:04,473 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 156 treesize of output 86 [2025-02-06 03:20:04,475 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 167 treesize of output 107 [2025-02-06 03:20:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-06 03:20:04,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:04,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:04,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932539010] [2025-02-06 03:20:04,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932539010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:04,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:04,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:20:04,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220245259] [2025-02-06 03:20:04,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:04,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:20:04,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:04,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:20:04,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:20:04,767 INFO L87 Difference]: Start difference. First operand 244 states and 326 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:20:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:07,389 INFO L93 Difference]: Finished difference Result 645 states and 862 transitions. [2025-02-06 03:20:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:20:07,400 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-06 03:20:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:07,404 INFO L225 Difference]: With dead ends: 645 [2025-02-06 03:20:07,404 INFO L226 Difference]: Without dead ends: 477 [2025-02-06 03:20:07,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:20:07,405 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 250 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:07,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 707 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 03:20:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-02-06 03:20:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2025-02-06 03:20:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 412 states have (on average 1.3058252427184467) internal successors, (538), 413 states have internal predecessors, (538), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:20:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 630 transitions. [2025-02-06 03:20:07,446 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 630 transitions. Word has length 109 [2025-02-06 03:20:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:07,447 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 630 transitions. [2025-02-06 03:20:07,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:20:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 630 transitions. [2025-02-06 03:20:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:20:07,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:07,448 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:20:07,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:07,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:07,652 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:07,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:07,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1044723085, now seen corresponding path program 1 times [2025-02-06 03:20:07,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:07,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196218889] [2025-02-06 03:20:07,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:07,653 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-02-06 03:20:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:07,655 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:07,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:07,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:20:08,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:20:08,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:08,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:08,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:20:08,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:08,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:20:08,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 113 treesize of output 65 [2025-02-06 03:20:08,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:08,672 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 191 treesize of output 77 [2025-02-06 03:20:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-06 03:20:08,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:20:08,855 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196218889] [2025-02-06 03:20:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196218889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2037528450] [2025-02-06 03:20:08,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:08,855 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:20:08,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:20:08,874 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:20:08,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-02-06 03:20:09,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:20:09,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:20:09,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:09,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:09,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:20:09,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:10,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:20:10,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2025-02-06 03:20:11,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:11,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 77 [2025-02-06 03:20:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-06 03:20:11,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:20:11,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2037528450] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:11,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:20:11,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-02-06 03:20:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621875528] [2025-02-06 03:20:11,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:20:11,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 03:20:11,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:11,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 03:20:11,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:20:11,214 INFO L87 Difference]: Start difference. First operand 474 states and 630 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-06 03:20:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:12,437 INFO L93 Difference]: Finished difference Result 811 states and 1082 transitions. [2025-02-06 03:20:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:20:12,442 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 109 [2025-02-06 03:20:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:12,444 INFO L225 Difference]: With dead ends: 811 [2025-02-06 03:20:12,444 INFO L226 Difference]: Without dead ends: 477 [2025-02-06 03:20:12,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:20:12,446 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 402 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:12,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 969 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:20:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-02-06 03:20:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2025-02-06 03:20:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 412 states have (on average 1.3009708737864079) internal successors, (536), 413 states have internal predecessors, (536), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:20:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 628 transitions. [2025-02-06 03:20:12,491 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 628 transitions. Word has length 109 [2025-02-06 03:20:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:12,491 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 628 transitions. [2025-02-06 03:20:12,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-06 03:20:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 628 transitions. [2025-02-06 03:20:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:20:12,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:12,493 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:20:12,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2025-02-06 03:20:12,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2025-02-06 03:20:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:20:12,898 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:12,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:12,898 INFO L85 PathProgramCache]: Analyzing trace with hash -762731378, now seen corresponding path program 1 times [2025-02-06 03:20:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102860190] [2025-02-06 03:20:12,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:12,899 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-02-06 03:20:12,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:12,902 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:12,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-02-06 03:20:12,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:20:13,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:20:13,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:13,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:13,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:20:13,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:13,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-02-06 03:20:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:20:13,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:13,269 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:13,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102860190] [2025-02-06 03:20:13,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102860190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:13,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:13,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:20:13,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497807061] [2025-02-06 03:20:13,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:13,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:20:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:13,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:20:13,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:20:13,271 INFO L87 Difference]: Start difference. First operand 474 states and 628 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:20:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:13,992 INFO L93 Difference]: Finished difference Result 1042 states and 1374 transitions. [2025-02-06 03:20:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:20:13,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-02-06 03:20:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:13,998 INFO L225 Difference]: With dead ends: 1042 [2025-02-06 03:20:13,998 INFO L226 Difference]: Without dead ends: 708 [2025-02-06 03:20:13,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:20:13,999 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 69 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:13,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 687 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:20:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-02-06 03:20:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 574. [2025-02-06 03:20:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 512 states have (on average 1.29296875) internal successors, (662), 513 states have internal predecessors, (662), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:20:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 754 transitions. [2025-02-06 03:20:14,041 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 754 transitions. Word has length 109 [2025-02-06 03:20:14,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:14,041 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 754 transitions. [2025-02-06 03:20:14,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:20:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 754 transitions. [2025-02-06 03:20:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:20:14,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:14,042 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:20:14,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2025-02-06 03:20:14,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:14,243 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:14,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1585977519, now seen corresponding path program 1 times [2025-02-06 03:20:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:14,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722307022] [2025-02-06 03:20:14,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:14,244 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-02-06 03:20:14,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:14,246 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:14,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2025-02-06 03:20:14,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:20:14,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:20:14,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:14,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:14,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:20:14,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-02-06 03:20:14,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:20:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 03:20:14,759 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:14,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722307022] [2025-02-06 03:20:14,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722307022] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:14,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:20:14,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-02-06 03:20:14,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608803635] [2025-02-06 03:20:14,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:14,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:20:14,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:14,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:20:14,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:20:14,760 INFO L87 Difference]: Start difference. First operand 574 states and 754 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:20:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:14,863 INFO L93 Difference]: Finished difference Result 1168 states and 1531 transitions. [2025-02-06 03:20:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:20:14,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-02-06 03:20:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:14,866 INFO L225 Difference]: With dead ends: 1168 [2025-02-06 03:20:14,866 INFO L226 Difference]: Without dead ends: 742 [2025-02-06 03:20:14,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:20:14,867 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 43 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:14,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 424 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:20:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-02-06 03:20:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 654. [2025-02-06 03:20:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 592 states have (on average 1.277027027027027) internal successors, (756), 593 states have internal predecessors, (756), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:20:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 848 transitions. [2025-02-06 03:20:14,906 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 848 transitions. Word has length 109 [2025-02-06 03:20:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:14,907 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 848 transitions. [2025-02-06 03:20:14,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 03:20:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 848 transitions. [2025-02-06 03:20:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 03:20:14,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:14,908 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:20:14,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-02-06 03:20:15,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:15,109 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:15,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash 142969259, now seen corresponding path program 1 times [2025-02-06 03:20:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408948979] [2025-02-06 03:20:15,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:15,110 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-02-06 03:20:15,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:15,112 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:15,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-02-06 03:20:15,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 03:20:15,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 03:20:15,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:15,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:15,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:20:15,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-06 03:20:15,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:15,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408948979] [2025-02-06 03:20:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408948979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:15,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:15,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:20:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592686875] [2025-02-06 03:20:15,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:15,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:20:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:15,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:20:15,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:20:15,371 INFO L87 Difference]: Start difference. First operand 654 states and 848 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:20:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:15,426 INFO L93 Difference]: Finished difference Result 1222 states and 1587 transitions. [2025-02-06 03:20:15,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:20:15,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-06 03:20:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:15,430 INFO L225 Difference]: With dead ends: 1222 [2025-02-06 03:20:15,431 INFO L226 Difference]: Without dead ends: 654 [2025-02-06 03:20:15,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:20:15,436 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:15,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:20:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-06 03:20:15,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2025-02-06 03:20:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 592 states have (on average 1.2736486486486487) internal successors, (754), 593 states have internal predecessors, (754), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 03:20:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 846 transitions. [2025-02-06 03:20:15,467 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 846 transitions. Word has length 109 [2025-02-06 03:20:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:15,467 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 846 transitions. [2025-02-06 03:20:15,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:20:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 846 transitions. [2025-02-06 03:20:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 03:20:15,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:15,469 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:20:15,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2025-02-06 03:20:15,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:15,670 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:15,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash 455209891, now seen corresponding path program 1 times [2025-02-06 03:20:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:20:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348023594] [2025-02-06 03:20:15,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:15,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:20:15,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:20:15,673 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-02-06 03:20:15,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2025-02-06 03:20:15,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 03:20:16,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 03:20:16,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:16,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:16,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 03:20:16,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:16,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:20:16,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:20:16,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 03:20:16,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:20:16,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2025-02-06 03:20:16,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:16,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 44 treesize of output 38 [2025-02-06 03:20:17,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 29 [2025-02-06 03:20:18,278 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 36 treesize of output 24 [2025-02-06 03:20:18,283 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 27 treesize of output 19 [2025-02-06 03:20:18,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:20:18,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 29 [2025-02-06 03:20:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-06 03:20:19,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:19,553 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:20:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348023594] [2025-02-06 03:20:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348023594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:19,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:19,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:20:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246665461] [2025-02-06 03:20:19,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:19,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:20:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:20:19,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:20:19,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:20:19,555 INFO L87 Difference]: Start difference. First operand 654 states and 846 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 03:20:25,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:20:30,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []