./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-83.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 f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:27:07,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:27:07,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:27:07,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:27:07,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:27:07,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:27:07,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:27:07,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:27:07,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:27:07,681 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:27:07,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:27:07,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:27:07,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:27:07,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:27:07,681 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:27:07,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:27:07,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:27:07,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:27:07,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:27:07,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:07,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:07,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:07,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:07,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:27:07,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:07,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:07,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:07,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:07,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:27:07,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:27:07,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:27:07,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:27:07,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:27:07,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:27:07,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:27:07,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:27:07,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:27:07,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:27:07,684 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 -> f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 [2025-01-09 15:27:07,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:27:07,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:27:07,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:27:07,914 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:27:07,914 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:27:07,915 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-83.i [2025-01-09 15:27:09,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab8cf3bd9/7c1a935e1b0a43c8b5acb8232ec59766/FLAG118fca94c [2025-01-09 15:27:09,300 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:27:09,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2025-01-09 15:27:09,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab8cf3bd9/7c1a935e1b0a43c8b5acb8232ec59766/FLAG118fca94c [2025-01-09 15:27:09,611 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab8cf3bd9/7c1a935e1b0a43c8b5acb8232ec59766 [2025-01-09 15:27:09,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:27:09,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:27:09,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:09,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:27:09,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:27:09,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c922ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09, skipping insertion in model container [2025-01-09 15:27:09,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:27:09,708 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-83.i[916,929] [2025-01-09 15:27:09,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:09,780 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:27:09,791 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-83.i[916,929] [2025-01-09 15:27:09,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:09,852 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:27:09,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09 WrapperNode [2025-01-09 15:27:09,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:09,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:09,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:27:09,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:27:09,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,898 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2025-01-09 15:27:09,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:09,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:27:09,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:27:09,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:27:09,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,925 INFO L175 MemorySlicer]: Split 130 memory accesses to 7 slices as follows [2, 6, 47, 21, 5, 9, 40]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 1, 1, 2]. The 16 writes are split as follows [0, 1, 7, 2, 1, 1, 4]. [2025-01-09 15:27:09,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:27:09,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:27:09,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:27:09,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:27:09,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (1/1) ... [2025-01-09 15:27:09,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:09,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:09,986 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-01-09 15:27:09,991 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-01-09 15:27:10,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:27:10,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:27:10,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:27:10,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:27:10,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:27:10,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:27:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:27:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:27:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:27:10,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:27:10,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:27:10,151 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:27:10,153 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:27:10,452 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2025-01-09 15:27:10,452 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:27:10,460 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:27:10,461 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:27:10,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:10 BoogieIcfgContainer [2025-01-09 15:27:10,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:27:10,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:27:10,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:27:10,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:27:10,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:27:09" (1/3) ... [2025-01-09 15:27:10,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7554319f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:10, skipping insertion in model container [2025-01-09 15:27:10,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:09" (2/3) ... [2025-01-09 15:27:10,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7554319f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:10, skipping insertion in model container [2025-01-09 15:27:10,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:10" (3/3) ... [2025-01-09 15:27:10,468 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-83.i [2025-01-09 15:27:10,483 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:27:10,484 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-83.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:27:10,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:27:10,541 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;@22f7e7bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:27:10,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:27:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:27:10,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:10,554 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:10,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:10,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 690085184, now seen corresponding path program 1 times [2025-01-09 15:27:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136830004] [2025-01-09 15:27:10,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:10,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:27:10,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:27:10,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:10,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 15:27:10,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136830004] [2025-01-09 15:27:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136830004] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494997168] [2025-01-09 15:27:10,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:10,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:10,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:10,806 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-01-09 15:27:10,815 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-01-09 15:27:10,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:27:11,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:27:11,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:11,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:11,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:27:11,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 15:27:11,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494997168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:11,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:11,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:27:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733042363] [2025-01-09 15:27:11,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:11,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:27:11,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:11,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:27:11,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:11,083 INFO L87 Difference]: Start difference. First operand has 111 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:11,110 INFO L93 Difference]: Finished difference Result 216 states and 334 transitions. [2025-01-09 15:27:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:27:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-01-09 15:27:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:11,117 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:27:11,117 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:27:11,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-01-09 15:27:11,124 INFO L435 NwaCegarLoop]: 153 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, 153 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-01-09 15:27:11,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:27:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 15:27:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2025-01-09 15:27:11,160 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 106 [2025-01-09 15:27:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2025-01-09 15:27:11,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2025-01-09 15:27:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:27:11,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:11,165 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:11,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:27:11,365 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-01-09 15:27:11,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:11,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:11,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2009368430, now seen corresponding path program 1 times [2025-01-09 15:27:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:11,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755319638] [2025-01-09 15:27:11,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:11,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:11,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:27:11,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:27:11,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:11,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755319638] [2025-01-09 15:27:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755319638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:11,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:11,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972100207] [2025-01-09 15:27:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:11,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:11,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:11,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:11,536 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:11,562 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2025-01-09 15:27:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:11,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-01-09 15:27:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:11,564 INFO L225 Difference]: With dead ends: 215 [2025-01-09 15:27:11,564 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:27:11,564 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-01-09 15:27:11,565 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:11,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:27:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 15:27:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2025-01-09 15:27:11,572 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 106 [2025-01-09 15:27:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:11,572 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2025-01-09 15:27:11,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2025-01-09 15:27:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:27:11,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:11,574 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:11,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:27:11,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:11,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash -866865964, now seen corresponding path program 1 times [2025-01-09 15:27:11,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:11,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683812115] [2025-01-09 15:27:11,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:11,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:11,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:27:11,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:27:11,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:11,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:11,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:11,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683812115] [2025-01-09 15:27:11,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683812115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:11,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:11,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:11,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596256840] [2025-01-09 15:27:11,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:11,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:11,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:11,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:11,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:11,738 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:11,763 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2025-01-09 15:27:11,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:11,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 15:27:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:11,764 INFO L225 Difference]: With dead ends: 220 [2025-01-09 15:27:11,764 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 15:27:11,765 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-01-09 15:27:11,765 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:11,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 15:27:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-01-09 15:27:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2025-01-09 15:27:11,772 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 106 [2025-01-09 15:27:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:11,772 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2025-01-09 15:27:11,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2025-01-09 15:27:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:27:11,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:11,774 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:11,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:27:11,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:11,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash -186807594, now seen corresponding path program 1 times [2025-01-09 15:27:11,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:11,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832349838] [2025-01-09 15:27:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:11,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:27:11,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:27:11,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:11,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832349838] [2025-01-09 15:27:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832349838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220156231] [2025-01-09 15:27:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:11,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:11,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:11,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:11,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:11,883 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:11,900 INFO L93 Difference]: Finished difference Result 224 states and 315 transitions. [2025-01-09 15:27:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 15:27:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:11,902 INFO L225 Difference]: With dead ends: 224 [2025-01-09 15:27:11,902 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 15:27:11,903 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-01-09 15:27:11,903 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:11,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 15:27:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-01-09 15:27:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-01-09 15:27:11,912 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 106 [2025-01-09 15:27:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:11,912 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-01-09 15:27:11,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-01-09 15:27:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:27:11,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:11,913 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:11,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:27:11,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:11,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash -184960552, now seen corresponding path program 1 times [2025-01-09 15:27:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:11,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555244884] [2025-01-09 15:27:11,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:11,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:27:11,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:27:11,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:11,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:12,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:12,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555244884] [2025-01-09 15:27:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555244884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:12,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:12,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617473171] [2025-01-09 15:27:12,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:12,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:12,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:12,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:12,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:12,187 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:12,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:12,238 INFO L93 Difference]: Finished difference Result 266 states and 372 transitions. [2025-01-09 15:27:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:12,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 15:27:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:12,241 INFO L225 Difference]: With dead ends: 266 [2025-01-09 15:27:12,242 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 15:27:12,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 15:27:12,243 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 148 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:12,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 448 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 15:27:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 114. [2025-01-09 15:27:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2025-01-09 15:27:12,250 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 106 [2025-01-09 15:27:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:12,250 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2025-01-09 15:27:12,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2025-01-09 15:27:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:27:12,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:12,256 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:12,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:27:12,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash 495738749, now seen corresponding path program 1 times [2025-01-09 15:27:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:12,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456143740] [2025-01-09 15:27:12,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:12,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:27:12,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:27:12,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:12,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:12,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:12,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456143740] [2025-01-09 15:27:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456143740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:12,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:12,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904224318] [2025-01-09 15:27:12,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:12,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:12,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:12,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:12,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:12,474 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:12,544 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2025-01-09 15:27:12,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:12,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-01-09 15:27:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:12,546 INFO L225 Difference]: With dead ends: 227 [2025-01-09 15:27:12,546 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:27:12,546 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-01-09 15:27:12,548 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:12,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 543 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:27:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 15:27:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 160 transitions. [2025-01-09 15:27:12,558 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 160 transitions. Word has length 107 [2025-01-09 15:27:12,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:12,558 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 160 transitions. [2025-01-09 15:27:12,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 160 transitions. [2025-01-09 15:27:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:27:12,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:12,561 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:12,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:27:12,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:12,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash 570492178, now seen corresponding path program 1 times [2025-01-09 15:27:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:12,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651270428] [2025-01-09 15:27:12,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:12,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:27:12,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:27:12,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:12,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:13,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:13,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651270428] [2025-01-09 15:27:13,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651270428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:13,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:13,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:27:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810362628] [2025-01-09 15:27:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:13,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:13,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:13,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:13,188 INFO L87 Difference]: Start difference. First operand 116 states and 160 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:13,446 INFO L93 Difference]: Finished difference Result 324 states and 448 transitions. [2025-01-09 15:27:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:27:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 15:27:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:13,450 INFO L225 Difference]: With dead ends: 324 [2025-01-09 15:27:13,450 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 15:27:13,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:13,451 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 110 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:13,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 954 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 15:27:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2025-01-09 15:27:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 188 states have (on average 1.351063829787234) internal successors, (254), 189 states have internal predecessors, (254), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:27:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 288 transitions. [2025-01-09 15:27:13,466 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 288 transitions. Word has length 108 [2025-01-09 15:27:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:13,466 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 288 transitions. [2025-01-09 15:27:13,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 288 transitions. [2025-01-09 15:27:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:27:13,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:13,467 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:13,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:27:13,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -450576176, now seen corresponding path program 1 times [2025-01-09 15:27:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033803004] [2025-01-09 15:27:13,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:13,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:27:13,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:27:13,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:13,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:27:13,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1697854267] [2025-01-09 15:27:13,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:13,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:13,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:13,573 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-01-09 15:27:13,574 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-01-09 15:27:13,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:27:13,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:27:13,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:13,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:13,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:27:13,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:13,910 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 24 treesize of output 12 [2025-01-09 15:27:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:13,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033803004] [2025-01-09 15:27:13,950 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:27:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697854267] [2025-01-09 15:27:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697854267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:13,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720039751] [2025-01-09 15:27:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:13,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:13,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:13,952 INFO L87 Difference]: Start difference. First operand 208 states and 288 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:14,170 INFO L93 Difference]: Finished difference Result 605 states and 842 transitions. [2025-01-09 15:27:14,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-01-09 15:27:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:14,174 INFO L225 Difference]: With dead ends: 605 [2025-01-09 15:27:14,176 INFO L226 Difference]: Without dead ends: 400 [2025-01-09 15:27:14,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:14,177 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 135 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:14,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 689 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-01-09 15:27:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 215. [2025-01-09 15:27:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 195 states have (on average 1.3435897435897435) internal successors, (262), 196 states have internal predecessors, (262), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:27:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 296 transitions. [2025-01-09 15:27:14,189 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 296 transitions. Word has length 108 [2025-01-09 15:27:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:14,189 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 296 transitions. [2025-01-09 15:27:14,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 296 transitions. [2025-01-09 15:27:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:27:14,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:14,190 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:14,197 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-01-09 15:27:14,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:14,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1233521519, now seen corresponding path program 1 times [2025-01-09 15:27:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:14,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309751006] [2025-01-09 15:27:14,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:14,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:27:14,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:27:14,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:14,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:14,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:14,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309751006] [2025-01-09 15:27:14,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309751006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:14,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:14,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:14,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216772362] [2025-01-09 15:27:14,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:14,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:14,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:14,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:14,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:14,754 INFO L87 Difference]: Start difference. First operand 215 states and 296 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:14,924 INFO L93 Difference]: Finished difference Result 468 states and 646 transitions. [2025-01-09 15:27:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:14,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 15:27:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:14,926 INFO L225 Difference]: With dead ends: 468 [2025-01-09 15:27:14,926 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 15:27:14,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:14,927 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 256 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:14,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 352 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 15:27:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 215. [2025-01-09 15:27:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 195 states have (on average 1.3333333333333333) internal successors, (260), 196 states have internal predecessors, (260), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:27:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 294 transitions. [2025-01-09 15:27:14,950 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 294 transitions. Word has length 108 [2025-01-09 15:27:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:14,950 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 294 transitions. [2025-01-09 15:27:14,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 294 transitions. [2025-01-09 15:27:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:27:14,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:14,951 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:14,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:27:14,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:14,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash 935627218, now seen corresponding path program 1 times [2025-01-09 15:27:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:14,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879667143] [2025-01-09 15:27:14,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:14,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:14,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:27:15,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:27:15,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:15,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:27:15,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260383081] [2025-01-09 15:27:15,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:15,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:15,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:15,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:15,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:27:15,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:27:15,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:27:15,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:15,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:15,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:27:15,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:15,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:15,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879667143] [2025-01-09 15:27:15,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:27:15,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260383081] [2025-01-09 15:27:15,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260383081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:15,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:15,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:27:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713287275] [2025-01-09 15:27:15,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:15,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:27:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:15,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:27:15,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:15,445 INFO L87 Difference]: Start difference. First operand 215 states and 294 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:15,722 INFO L93 Difference]: Finished difference Result 843 states and 1158 transitions. [2025-01-09 15:27:15,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:27:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-01-09 15:27:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:15,725 INFO L225 Difference]: With dead ends: 843 [2025-01-09 15:27:15,725 INFO L226 Difference]: Without dead ends: 631 [2025-01-09 15:27:15,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:27:15,726 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 375 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:15,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 895 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-01-09 15:27:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 289. [2025-01-09 15:27:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 257 states have (on average 1.3346303501945525) internal successors, (343), 258 states have internal predecessors, (343), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 399 transitions. [2025-01-09 15:27:15,742 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 399 transitions. Word has length 108 [2025-01-09 15:27:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:15,743 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 399 transitions. [2025-01-09 15:27:15,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 399 transitions. [2025-01-09 15:27:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:27:15,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:15,744 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:15,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:15,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:15,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:15,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:15,945 INFO L85 PathProgramCache]: Analyzing trace with hash -652720684, now seen corresponding path program 1 times [2025-01-09 15:27:15,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:15,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697389704] [2025-01-09 15:27:15,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:15,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:27:15,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:27:15,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:15,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 15:27:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:16,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697389704] [2025-01-09 15:27:16,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697389704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:16,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:16,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:27:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589494756] [2025-01-09 15:27:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:16,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:16,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:16,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:16,648 INFO L87 Difference]: Start difference. First operand 289 states and 399 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:17,246 INFO L93 Difference]: Finished difference Result 598 states and 814 transitions. [2025-01-09 15:27:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 15:27:17,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 15:27:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:17,250 INFO L225 Difference]: With dead ends: 598 [2025-01-09 15:27:17,251 INFO L226 Difference]: Without dead ends: 386 [2025-01-09 15:27:17,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:27:17,254 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 235 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:17,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1143 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:27:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-01-09 15:27:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 312. [2025-01-09 15:27:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 278 states have (on average 1.3345323741007193) internal successors, (371), 279 states have internal predecessors, (371), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 427 transitions. [2025-01-09 15:27:17,279 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 427 transitions. Word has length 108 [2025-01-09 15:27:17,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:17,279 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 427 transitions. [2025-01-09 15:27:17,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 427 transitions. [2025-01-09 15:27:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:27:17,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:17,280 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:17,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:27:17,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:17,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:17,281 INFO L85 PathProgramCache]: Analyzing trace with hash -141125420, now seen corresponding path program 1 times [2025-01-09 15:27:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:17,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705182853] [2025-01-09 15:27:17,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:17,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:27:17,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:27:17,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:17,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:17,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705182853] [2025-01-09 15:27:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705182853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:27:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628823959] [2025-01-09 15:27:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:17,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:27:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:17,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:27:17,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:17,889 INFO L87 Difference]: Start difference. First operand 312 states and 427 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:18,319 INFO L93 Difference]: Finished difference Result 619 states and 848 transitions. [2025-01-09 15:27:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:27:18,320 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 15:27:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:18,323 INFO L225 Difference]: With dead ends: 619 [2025-01-09 15:27:18,323 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 15:27:18,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:18,324 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 99 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:18,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1170 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 15:27:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 332. [2025-01-09 15:27:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 298 states have (on average 1.3389261744966443) internal successors, (399), 299 states have internal predecessors, (399), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 455 transitions. [2025-01-09 15:27:18,346 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 455 transitions. Word has length 108 [2025-01-09 15:27:18,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:18,346 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 455 transitions. [2025-01-09 15:27:18,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 455 transitions. [2025-01-09 15:27:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:27:18,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:18,347 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:18,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:27:18,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:18,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1162193774, now seen corresponding path program 1 times [2025-01-09 15:27:18,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:18,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030959382] [2025-01-09 15:27:18,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:18,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:27:18,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:27:18,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:18,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:18,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030959382] [2025-01-09 15:27:18,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030959382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:18,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:18,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:27:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871197512] [2025-01-09 15:27:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:18,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:18,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:18,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:18,758 INFO L87 Difference]: Start difference. First operand 332 states and 455 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:18,937 INFO L93 Difference]: Finished difference Result 679 states and 932 transitions. [2025-01-09 15:27:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:27:18,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 15:27:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:18,939 INFO L225 Difference]: With dead ends: 679 [2025-01-09 15:27:18,939 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 15:27:18,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:18,940 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 118 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:18,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1341 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 15:27:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 350. [2025-01-09 15:27:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 316 states have (on average 1.3449367088607596) internal successors, (425), 317 states have internal predecessors, (425), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 481 transitions. [2025-01-09 15:27:18,959 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 481 transitions. Word has length 108 [2025-01-09 15:27:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:18,959 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 481 transitions. [2025-01-09 15:27:18,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 481 transitions. [2025-01-09 15:27:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:27:18,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:18,960 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:18,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:27:18,961 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:18,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1913654632, now seen corresponding path program 1 times [2025-01-09 15:27:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612697378] [2025-01-09 15:27:18,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:18,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:27:19,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:27:19,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:19,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:27:19,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868772825] [2025-01-09 15:27:19,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:19,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:19,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:19,004 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:19,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:27:19,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:27:19,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:27:19,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:19,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:19,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:27:19,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:19,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:19,228 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 19 treesize of output 9 [2025-01-09 15:27:19,256 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 19 treesize of output 7 [2025-01-09 15:27:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:19,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:19,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:19,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612697378] [2025-01-09 15:27:19,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:27:19,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868772825] [2025-01-09 15:27:19,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868772825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:19,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:19,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409118174] [2025-01-09 15:27:19,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:19,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:19,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:19,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:19,268 INFO L87 Difference]: Start difference. First operand 350 states and 481 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:19,387 INFO L93 Difference]: Finished difference Result 821 states and 1131 transitions. [2025-01-09 15:27:19,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:19,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-01-09 15:27:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:19,390 INFO L225 Difference]: With dead ends: 821 [2025-01-09 15:27:19,391 INFO L226 Difference]: Without dead ends: 552 [2025-01-09 15:27:19,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:19,392 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 117 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:19,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 794 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-01-09 15:27:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 371. [2025-01-09 15:27:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 337 states have (on average 1.3501483679525224) internal successors, (455), 338 states have internal predecessors, (455), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 511 transitions. [2025-01-09 15:27:19,437 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 511 transitions. Word has length 109 [2025-01-09 15:27:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:19,437 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 511 transitions. [2025-01-09 15:27:19,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 511 transitions. [2025-01-09 15:27:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:27:19,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:19,438 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:19,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 15:27:19,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 15:27:19,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:19,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash 792964762, now seen corresponding path program 1 times [2025-01-09 15:27:19,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:19,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85047329] [2025-01-09 15:27:19,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:19,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:19,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:27:19,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:27:19,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:27:19,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2143927832] [2025-01-09 15:27:19,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:19,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:19,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:19,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:27:19,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:27:19,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:27:19,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:19,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:19,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:27:19,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:19,948 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 9 treesize of output 3 [2025-01-09 15:27:19,986 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-01-09 15:27:20,033 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 17 treesize of output 17 [2025-01-09 15:27:20,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:20,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 12 [2025-01-09 15:27:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:20,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:20,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:20,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85047329] [2025-01-09 15:27:20,158 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:27:20,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143927832] [2025-01-09 15:27:20,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143927832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:20,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:20,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:27:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324954902] [2025-01-09 15:27:20,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:20,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:27:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:20,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:27:20,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:20,159 INFO L87 Difference]: Start difference. First operand 371 states and 511 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:20,443 INFO L93 Difference]: Finished difference Result 986 states and 1358 transitions. [2025-01-09 15:27:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:27:20,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-01-09 15:27:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:20,446 INFO L225 Difference]: With dead ends: 986 [2025-01-09 15:27:20,447 INFO L226 Difference]: Without dead ends: 680 [2025-01-09 15:27:20,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:27:20,448 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 241 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:20,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 883 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-01-09 15:27:20,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 418. [2025-01-09 15:27:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 384 states have (on average 1.3515625) internal successors, (519), 385 states have internal predecessors, (519), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 575 transitions. [2025-01-09 15:27:20,467 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 575 transitions. Word has length 109 [2025-01-09 15:27:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:20,467 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 575 transitions. [2025-01-09 15:27:20,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 575 transitions. [2025-01-09 15:27:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:27:20,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:20,468 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:20,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 15:27:20,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 15:27:20,669 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:20,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:20,670 INFO L85 PathProgramCache]: Analyzing trace with hash -538979053, now seen corresponding path program 1 times [2025-01-09 15:27:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:20,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64242493] [2025-01-09 15:27:20,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:20,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:20,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:20,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:20,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:27:20,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [795130804] [2025-01-09 15:27:20,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:20,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:20,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:20,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:20,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 15:27:20,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:20,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:20,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:20,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:20,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 15:27:20,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:21,231 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 23 treesize of output 3 [2025-01-09 15:27:21,369 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 25 treesize of output 13 [2025-01-09 15:27:21,507 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 3 [2025-01-09 15:27:21,587 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-01-09 15:27:21,591 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 7 treesize of output 3 [2025-01-09 15:27:21,606 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 23 treesize of output 11 [2025-01-09 15:27:21,627 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 15:27:21,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:21,850 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 48 treesize of output 36 [2025-01-09 15:27:22,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:22,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64242493] [2025-01-09 15:27:22,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:27:22,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795130804] [2025-01-09 15:27:22,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795130804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:22,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:22,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-01-09 15:27:22,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458348680] [2025-01-09 15:27:22,018 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 15:27:22,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:27:22,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:22,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:27:22,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:27:22,019 INFO L87 Difference]: Start difference. First operand 418 states and 575 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 15:27:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:22,782 INFO L93 Difference]: Finished difference Result 827 states and 1131 transitions. [2025-01-09 15:27:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:27:22,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 110 [2025-01-09 15:27:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:22,785 INFO L225 Difference]: With dead ends: 827 [2025-01-09 15:27:22,790 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 15:27:22,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:27:22,792 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 121 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:22,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1230 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:27:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 15:27:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 423. [2025-01-09 15:27:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 388 states have (on average 1.347938144329897) internal successors, (523), 389 states have internal predecessors, (523), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 579 transitions. [2025-01-09 15:27:22,825 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 579 transitions. Word has length 110 [2025-01-09 15:27:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:22,825 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 579 transitions. [2025-01-09 15:27:22,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 15:27:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 579 transitions. [2025-01-09 15:27:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:27:22,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:22,827 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:22,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:23,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 15:27:23,028 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:23,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:23,029 INFO L85 PathProgramCache]: Analyzing trace with hash 504721555, now seen corresponding path program 1 times [2025-01-09 15:27:23,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:23,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720994197] [2025-01-09 15:27:23,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:23,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:23,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:23,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:23,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:23,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:27:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620197667] [2025-01-09 15:27:23,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:23,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:23,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:23,067 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:23,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 15:27:23,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:23,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:23,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:23,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:23,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 15:27:23,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:23,686 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-01-09 15:27:23,747 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 23 treesize of output 3 [2025-01-09 15:27:23,806 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 25 treesize of output 13 [2025-01-09 15:27:23,843 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 17 treesize of output 17 [2025-01-09 15:27:23,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:23,914 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 54 treesize of output 43 [2025-01-09 15:27:24,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:24,062 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 48 treesize of output 30 [2025-01-09 15:27:24,065 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 31 treesize of output 23 [2025-01-09 15:27:24,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:24,091 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 44 treesize of output 22 [2025-01-09 15:27:24,118 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:27:24,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720994197] [2025-01-09 15:27:24,392 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:27:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620197667] [2025-01-09 15:27:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620197667] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:24,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-01-09 15:27:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454173461] [2025-01-09 15:27:24,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:24,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:24,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:24,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:27:24,393 INFO L87 Difference]: Start difference. First operand 423 states and 579 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:24,947 INFO L93 Difference]: Finished difference Result 775 states and 1063 transitions. [2025-01-09 15:27:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:27:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 15:27:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:24,950 INFO L225 Difference]: With dead ends: 775 [2025-01-09 15:27:24,950 INFO L226 Difference]: Without dead ends: 469 [2025-01-09 15:27:24,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:27:24,951 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 170 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:24,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 789 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-01-09 15:27:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 415. [2025-01-09 15:27:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 380 states have (on average 1.3473684210526315) internal successors, (512), 381 states have internal predecessors, (512), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 568 transitions. [2025-01-09 15:27:24,965 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 568 transitions. Word has length 110 [2025-01-09 15:27:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:24,965 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 568 transitions. [2025-01-09 15:27:24,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 568 transitions. [2025-01-09 15:27:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:27:24,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:24,966 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:24,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:25,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:25,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:25,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash -496727536, now seen corresponding path program 1 times [2025-01-09 15:27:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904388201] [2025-01-09 15:27:25,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:25,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:25,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:25,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:25,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:25,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:25,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904388201] [2025-01-09 15:27:25,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904388201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:25,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:25,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:25,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358177915] [2025-01-09 15:27:25,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:25,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:25,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:25,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:25,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:25,248 INFO L87 Difference]: Start difference. First operand 415 states and 568 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:25,342 INFO L93 Difference]: Finished difference Result 930 states and 1281 transitions. [2025-01-09 15:27:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:25,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 15:27:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:25,345 INFO L225 Difference]: With dead ends: 930 [2025-01-09 15:27:25,345 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 15:27:25,346 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-01-09 15:27:25,346 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 115 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:25,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 675 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 15:27:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 492. [2025-01-09 15:27:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 457 states have (on average 1.3566739606126914) internal successors, (620), 458 states have internal predecessors, (620), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 676 transitions. [2025-01-09 15:27:25,363 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 676 transitions. Word has length 110 [2025-01-09 15:27:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:25,364 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 676 transitions. [2025-01-09 15:27:25,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 676 transitions. [2025-01-09 15:27:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:27:25,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:25,365 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:25,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:27:25,365 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1308255463, now seen corresponding path program 1 times [2025-01-09 15:27:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439174063] [2025-01-09 15:27:25,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:25,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:25,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:25,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:25,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:25,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439174063] [2025-01-09 15:27:25,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439174063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:25,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:25,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:25,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661530010] [2025-01-09 15:27:25,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:25,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:25,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:25,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:25,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:25,572 INFO L87 Difference]: Start difference. First operand 492 states and 676 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:25,621 INFO L93 Difference]: Finished difference Result 886 states and 1223 transitions. [2025-01-09 15:27:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:25,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-01-09 15:27:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:25,624 INFO L225 Difference]: With dead ends: 886 [2025-01-09 15:27:25,624 INFO L226 Difference]: Without dead ends: 497 [2025-01-09 15:27:25,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:25,624 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 67 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:25,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 701 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-09 15:27:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 456. [2025-01-09 15:27:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 421 states have (on average 1.330166270783848) internal successors, (560), 422 states have internal predecessors, (560), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 616 transitions. [2025-01-09 15:27:25,639 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 616 transitions. Word has length 110 [2025-01-09 15:27:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:25,639 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 616 transitions. [2025-01-09 15:27:25,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 616 transitions. [2025-01-09 15:27:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:27:25,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:25,640 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:25,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:27:25,640 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:25,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:25,641 INFO L85 PathProgramCache]: Analyzing trace with hash 162620821, now seen corresponding path program 1 times [2025-01-09 15:27:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309329976] [2025-01-09 15:27:25,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:25,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:25,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:25,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:25,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:27:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663275193] [2025-01-09 15:27:25,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:25,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:25,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:25,674 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:25,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 15:27:25,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:25,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:25,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:25,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:25,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 15:27:25,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:25,973 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 9 treesize of output 3 [2025-01-09 15:27:26,058 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-01-09 15:27:26,088 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 23 treesize of output 3 [2025-01-09 15:27:26,123 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 17 treesize of output 17 [2025-01-09 15:27:26,174 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 39 treesize of output 23 [2025-01-09 15:27:26,279 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-01-09 15:27:26,282 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 23 treesize of output 15 [2025-01-09 15:27:26,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:26,315 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 36 treesize of output 14 [2025-01-09 15:27:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:27:26,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:26,926 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 42 [2025-01-09 15:27:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309329976] [2025-01-09 15:27:26,986 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:27:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663275193] [2025-01-09 15:27:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663275193] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:26,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2025-01-09 15:27:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199999704] [2025-01-09 15:27:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:26,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:26,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:26,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:27:26,988 INFO L87 Difference]: Start difference. First operand 456 states and 616 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:28,262 INFO L93 Difference]: Finished difference Result 844 states and 1145 transitions. [2025-01-09 15:27:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:27:28,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 15:27:28,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:28,266 INFO L225 Difference]: With dead ends: 844 [2025-01-09 15:27:28,266 INFO L226 Difference]: Without dead ends: 491 [2025-01-09 15:27:28,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:27:28,268 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 148 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:28,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 693 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:27:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-01-09 15:27:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 452. [2025-01-09 15:27:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 417 states have (on average 1.328537170263789) internal successors, (554), 418 states have internal predecessors, (554), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 610 transitions. [2025-01-09 15:27:28,285 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 610 transitions. Word has length 110 [2025-01-09 15:27:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:28,285 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 610 transitions. [2025-01-09 15:27:28,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 610 transitions. [2025-01-09 15:27:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 15:27:28,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:28,286 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:28,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:28,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:28,491 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:28,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1206321429, now seen corresponding path program 1 times [2025-01-09 15:27:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:28,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180332174] [2025-01-09 15:27:28,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:28,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:28,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:28,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:28,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:27:28,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204915965] [2025-01-09 15:27:28,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:28,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:28,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:28,538 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:28,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 15:27:28,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 15:27:28,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 15:27:28,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:28,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:28,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:27:28,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:28,833 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-01-09 15:27:28,839 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 17 treesize of output 17 [2025-01-09 15:27:28,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:28,943 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 41 treesize of output 19 [2025-01-09 15:27:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:28,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:28,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:28,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180332174] [2025-01-09 15:27:28,952 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:27:28,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204915965] [2025-01-09 15:27:28,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204915965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:28,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147269361] [2025-01-09 15:27:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:28,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:28,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:28,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:28,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:28,953 INFO L87 Difference]: Start difference. First operand 452 states and 610 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:29,078 INFO L93 Difference]: Finished difference Result 881 states and 1188 transitions. [2025-01-09 15:27:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:29,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 15:27:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:29,081 INFO L225 Difference]: With dead ends: 881 [2025-01-09 15:27:29,081 INFO L226 Difference]: Without dead ends: 532 [2025-01-09 15:27:29,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:29,082 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 182 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:29,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 713 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-01-09 15:27:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 414. [2025-01-09 15:27:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 377 states have (on average 1.3103448275862069) internal successors, (494), 378 states have internal predecessors, (494), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 550 transitions. [2025-01-09 15:27:29,098 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 550 transitions. Word has length 110 [2025-01-09 15:27:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:29,098 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 550 transitions. [2025-01-09 15:27:29,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 550 transitions. [2025-01-09 15:27:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:27:29,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:29,099 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:29,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 15:27:29,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:29,300 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:29,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:29,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1807309076, now seen corresponding path program 1 times [2025-01-09 15:27:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:29,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249858755] [2025-01-09 15:27:29,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:29,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:27:29,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:27:29,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:29,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:27:29,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738414543] [2025-01-09 15:27:29,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:29,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:29,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:29,341 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:29,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 15:27:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:27:29,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:27:29,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:29,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:27:29,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:27:29,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:27:29,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:27:29,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:29,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:27:29,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:27:29,773 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:27:29,774 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:27:29,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 15:27:29,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:29,978 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:27:30,052 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:27:30,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:27:30 BoogieIcfgContainer [2025-01-09 15:27:30,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:27:30,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:27:30,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:27:30,055 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:27:30,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:10" (3/4) ... [2025-01-09 15:27:30,057 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:27:30,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:27:30,059 INFO L158 Benchmark]: Toolchain (without parser) took 20445.25ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 132.2MB in the beginning and 311.8MB in the end (delta: -179.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2025-01-09 15:27:30,059 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:27:30,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.14ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 117.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:27:30,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.19ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 113.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:27:30,059 INFO L158 Benchmark]: Boogie Preprocessor took 59.23ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 107.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:27:30,059 INFO L158 Benchmark]: RCFGBuilder took 502.82ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 72.2MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:27:30,060 INFO L158 Benchmark]: TraceAbstraction took 19592.23ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 71.4MB in the beginning and 311.9MB in the end (delta: -240.6MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. [2025-01-09 15:27:30,060 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 369.1MB. Free memory was 311.9MB in the beginning and 311.8MB in the end (delta: 115.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:27:30,060 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.26ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.14ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 117.2MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.19ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 113.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.23ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 107.9MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 502.82ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 72.2MB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19592.23ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 71.4MB in the beginning and 311.9MB in the end (delta: -240.6MB). Peak memory consumption was 160.2MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 369.1MB. Free memory was 311.9MB in the beginning and 311.8MB in the end (delta: 115.4kB). 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 bitwiseOr at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation 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[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L25-L27] double double_Array_0[5] = { 24.8, 0.8, 127.625, 128.75, 1.5 }; [L28-L30] signed char signed_char_Array_0[2] = { 5, 64 }; [L28-L30] signed char signed_char_Array_0[2] = { 5, 64 }; [L28-L30] signed char signed_char_Array_0[2] = { 5, 64 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -128 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -128 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 4 }; [L34-L36] unsigned char unsigned_char_Array_0[1] = { 4 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 25, 128 }; [L40] unsigned short int last_1_unsigned_short_int_Array_0_1_ = 128; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L99] isInitial = 1 [L100] FCALL initially() [L102] CALL updateLastVariables() [L92] EXPR unsigned_short_int_Array_0[1] [L92] last_1_unsigned_short_int_Array_0_1_ = unsigned_short_int_Array_0[1] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] 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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] 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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] 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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] 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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] double_Array_0[1] = __VERIFIER_nondet_double() [L77] EXPR double_Array_0[1] [L77] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L77] EXPR double_Array_0[1] [L77] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] double_Array_0[3] = __VERIFIER_nondet_double() [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F [L79] EXPR double_Array_0[3] [L79] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L81] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] 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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] 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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET updateVariables() [L104] CALL step() [L44] signed_short_int_Array_0[0] = 200 [L45] EXPR signed_char_Array_0[0] [L45] signed_char_Array_0[1] = signed_char_Array_0[0] [L46] EXPR double_Array_0[1] [L46] double_Array_0[4] = double_Array_0[1] [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR unsigned_char_Array_0[0] [L47] signed long int stepLocal_0 = unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]; [L48] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L51] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) [L51] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=1, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] COND TRUE stepLocal_0 >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)))) [L52] EXPR unsigned_char_Array_0[0] [L52] unsigned_short_int_Array_0[1] = unsigned_char_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[1] [L57] signed long int stepLocal_2 = unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1]; [L58] EXPR signed_short_int_Array_0[0] [L58] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] EXPR signed_short_int_Array_0[0] ^ signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=2, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] signed long int stepLocal_1 = signed_short_int_Array_0[0] ^ signed_char_Array_0[1]; [L59] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND FALSE !(signed_char_Array_0[1] <= stepLocal_2) [L66] EXPR double_Array_0[1] [L66] double_Array_0[2] = double_Array_0[1] [L68] EXPR signed_char_Array_0[1] [L68] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] COND FALSE !(signed_char_Array_0[1] > signed_char_Array_0[1]) [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR unsigned_char_Array_0[0] [L95] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) [L95] EXPR (((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L95] EXPR unsigned_short_int_Array_0[1] [L95] EXPR unsigned_char_Array_0[0] [L95] EXPR ((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1]))) [L95] EXPR signed_char_Array_0[1] [L95] EXPR unsigned_short_int_Array_0[0] [L95] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])) [L95] EXPR double_Array_0[2] [L95] EXPR double_Array_0[1] [L95] EXPR (signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (double_Array_0[4] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (double_Array_0[4] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95-L96] return (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) < 0 ) ? -((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) : ((((unsigned_short_int_Array_0[0]) < 0 ) ? -(unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))))) : (((unsigned_short_int_Array_0[0] / unsigned_char_Array_0[0]) >= (((((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) < ((~ last_1_unsigned_short_int_Array_0_1_))) ? ((last_1_unsigned_short_int_Array_0_1_ * signed_char_Array_0[1])) : ((~ last_1_unsigned_short_int_Array_0_1_))))) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && ((signed_char_Array_0[1] <= (unsigned_short_int_Array_0[0] + unsigned_short_int_Array_0[1])) ? ((unsigned_short_int_Array_0[1] == (signed_short_int_Array_0[0] ^ signed_char_Array_0[1])) ? (double_Array_0[2] == ((double) (((((double_Array_0[1]) < 0 ) ? -(double_Array_0[1]) : (double_Array_0[1]))) + double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[3]))) : (double_Array_0[2] == ((double) double_Array_0[1])))) && ((signed_char_Array_0[1] > signed_char_Array_0[1]) ? (double_Array_0[0] == ((double) ((((double_Array_0[3]) < (double_Array_0[1])) ? (double_Array_0[3]) : (double_Array_0[1]))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) 200))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0]))) && (double_Array_0[4] == ((double) double_Array_0[1])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_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}, isInitial=1, last_1_unsigned_short_int_Array_0_1_=128, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2657 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2642 mSDsluCounter, 15489 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11873 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3388 IncrementalHoareTripleChecker+Invalid, 3515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 3616 mSDtfsCounter, 3388 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1361 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=18, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1751 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 3473 NumberOfCodeBlocks, 3473 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2573 ConstructedInterpolants, 4 QuantifiedInterpolants, 12432 SizeOfPredicates, 77 NumberOfNonLiveVariables, 3698 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 4894/5280 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-01-09 15:27:30,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-83.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 f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:27:32,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:27:32,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:27:32,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:27:32,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:27:32,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:27:32,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:27:32,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:27:32,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:27:32,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:27:32,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:27:32,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:27:32,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:27:32,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:27:32,468 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:27:32,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:27:32,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:27:32,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:27:32,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:27:32,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:27:32,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:27:32,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:27:32,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:27:32,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:27:32,469 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:27:32,469 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:27:32,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:27:32,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:27:32,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:27:32,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:27:32,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:32,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:32,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:27:32,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:27:32,471 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 -> f973a40b26aaa32bb1cc01afeff98c3363a14790c658d13c89361ba4409a62b2 [2025-01-09 15:27:32,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:27:32,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:27:32,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:27:32,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:27:32,717 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:27:32,719 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-83.i [2025-01-09 15:27:33,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4272d60e/41479b9dd840414d91509464ee9fa696/FLAG230a308d3 [2025-01-09 15:27:34,095 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:27:34,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-83.i [2025-01-09 15:27:34,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4272d60e/41479b9dd840414d91509464ee9fa696/FLAG230a308d3 [2025-01-09 15:27:34,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4272d60e/41479b9dd840414d91509464ee9fa696 [2025-01-09 15:27:34,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:27:34,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:27:34,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:34,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:27:34,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:27:34,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628f221b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34, skipping insertion in model container [2025-01-09 15:27:34,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:27:34,238 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-83.i[916,929] [2025-01-09 15:27:34,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:34,300 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:27:34,307 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-83.i[916,929] [2025-01-09 15:27:34,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:34,374 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:27:34,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34 WrapperNode [2025-01-09 15:27:34,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:34,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:34,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:27:34,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:27:34,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,434 INFO L138 Inliner]: procedures = 33, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2025-01-09 15:27:34,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:34,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:27:34,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:27:34,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:27:34,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,479 INFO L175 MemorySlicer]: Split 130 memory accesses to 7 slices as follows [2, 6, 47, 21, 5, 9, 40]. 36 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 1, 1, 2]. The 16 writes are split as follows [0, 1, 7, 2, 1, 1, 4]. [2025-01-09 15:27:34,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:27:34,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:27:34,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:27:34,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:27:34,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (1/1) ... [2025-01-09 15:27:34,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:34,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:34,566 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-01-09 15:27:34,573 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-01-09 15:27:34,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:27:34,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:27:34,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:27:34,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:27:34,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:27:34,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:27:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:27:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:27:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:27:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:27:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:27:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:27:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:27:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:27:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:27:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:27:34,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:27:34,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:27:34,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:27:34,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:27:34,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:27:34,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:27:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:27:34,733 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:27:34,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:27:35,556 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-09 15:27:35,557 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:27:35,564 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:27:35,564 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:27:35,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:35 BoogieIcfgContainer [2025-01-09 15:27:35,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:27:35,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:27:35,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:27:35,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:27:35,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:27:34" (1/3) ... [2025-01-09 15:27:35,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745a0715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:35, skipping insertion in model container [2025-01-09 15:27:35,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:34" (2/3) ... [2025-01-09 15:27:35,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745a0715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:35, skipping insertion in model container [2025-01-09 15:27:35,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:35" (3/3) ... [2025-01-09 15:27:35,570 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-83.i [2025-01-09 15:27:35,579 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:27:35,580 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-83.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:27:35,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:27:35,622 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;@26bc7bbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:27:35,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:27:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:35,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:35,637 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:35,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:35,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1881112616, now seen corresponding path program 1 times [2025-01-09 15:27:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:35,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037965505] [2025-01-09 15:27:35,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:35,651 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-01-09 15:27:35,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:35,655 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-01-09 15:27:35,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 (2)] Waiting until timeout for monitored process [2025-01-09 15:27:35,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:35,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:35,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:35,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:35,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:27:36,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 15:27:36,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:36,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:36,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037965505] [2025-01-09 15:27:36,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037965505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:36,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:36,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:27:36,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767241225] [2025-01-09 15:27:36,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:27:36,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:36,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:27:36,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:36,059 INFO L87 Difference]: Start difference. First operand has 102 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 89 states have internal predecessors, (127), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:36,079 INFO L93 Difference]: Finished difference Result 198 states and 304 transitions. [2025-01-09 15:27:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:27:36,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2025-01-09 15:27:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:36,111 INFO L225 Difference]: With dead ends: 198 [2025-01-09 15:27:36,111 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 15:27:36,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-01-09 15:27:36,115 INFO L435 NwaCegarLoop]: 138 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, 138 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-01-09 15:27:36,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 15:27:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 15:27:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2025-01-09 15:27:36,162 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 104 [2025-01-09 15:27:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:36,163 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2025-01-09 15:27:36,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2025-01-09 15:27:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:36,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:36,170 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:36,183 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-01-09 15:27:36,370 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-01-09 15:27:36,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:36,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash -517224454, now seen corresponding path program 1 times [2025-01-09 15:27:36,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:36,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224770751] [2025-01-09 15:27:36,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:36,373 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-01-09 15:27:36,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:36,378 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-01-09 15:27:36,379 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-01-09 15:27:36,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:36,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:36,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:36,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:36,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:27:36,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 15:27:36,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:36,712 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:36,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224770751] [2025-01-09 15:27:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224770751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:36,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527703453] [2025-01-09 15:27:36,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:36,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:36,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:36,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:36,714 INFO L87 Difference]: Start difference. First operand 99 states and 138 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:36,797 INFO L93 Difference]: Finished difference Result 197 states and 276 transitions. [2025-01-09 15:27:36,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:36,801 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2025-01-09 15:27:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:36,802 INFO L225 Difference]: With dead ends: 197 [2025-01-09 15:27:36,802 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 15:27:36,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 101 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-01-09 15:27:36,802 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:36,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 15:27:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 15:27:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 15:27:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2025-01-09 15:27:36,809 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 104 [2025-01-09 15:27:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:36,810 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2025-01-09 15:27:36,810 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 15:27:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2025-01-09 15:27:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:36,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:36,811 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:36,821 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-01-09 15:27:37,016 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-01-09 15:27:37,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:37,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1356258116, now seen corresponding path program 1 times [2025-01-09 15:27:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159118647] [2025-01-09 15:27:37,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:37,019 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-01-09 15:27:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:37,022 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-01-09 15:27:37,023 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-01-09 15:27:37,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:37,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:37,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:37,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:37,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:27:37,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:37,324 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-01-09 15:27:37,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:37,523 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 19 treesize of output 9 [2025-01-09 15:27:37,530 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 31 treesize of output 19 [2025-01-09 15:27:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:37,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:37,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:37,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159118647] [2025-01-09 15:27:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159118647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:37,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:37,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947229768] [2025-01-09 15:27:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:37,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:37,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:37,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:37,576 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:38,301 INFO L93 Difference]: Finished difference Result 387 states and 540 transitions. [2025-01-09 15:27:38,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:27:38,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 15:27:38,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:38,306 INFO L225 Difference]: With dead ends: 387 [2025-01-09 15:27:38,306 INFO L226 Difference]: Without dead ends: 289 [2025-01-09 15:27:38,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:27:38,307 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 262 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:38,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1092 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:27:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-01-09 15:27:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 147. [2025-01-09 15:27:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.319672131147541) internal successors, (161), 122 states have internal predecessors, (161), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:27:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 205 transitions. [2025-01-09 15:27:38,321 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 205 transitions. Word has length 104 [2025-01-09 15:27:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:38,322 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 205 transitions. [2025-01-09 15:27:38,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:38,322 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 205 transitions. [2025-01-09 15:27:38,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:38,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:38,323 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:38,332 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 (4)] Ended with exit code 0 [2025-01-09 15:27:38,527 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-01-09 15:27:38,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:38,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1215709506, now seen corresponding path program 1 times [2025-01-09 15:27:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:38,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117229437] [2025-01-09 15:27:38,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:38,529 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-01-09 15:27:38,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:38,531 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-01-09 15:27:38,533 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-01-09 15:27:38,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:38,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:38,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:38,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:38,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:27:38,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:38,835 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-01-09 15:27:39,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:39,011 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 19 treesize of output 9 [2025-01-09 15:27:39,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-01-09 15:27:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:39,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:39,220 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117229437] [2025-01-09 15:27:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117229437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:39,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:39,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747394801] [2025-01-09 15:27:39,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:39,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:39,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:39,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:39,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:39,221 INFO L87 Difference]: Start difference. First operand 147 states and 205 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:40,666 INFO L93 Difference]: Finished difference Result 344 states and 478 transitions. [2025-01-09 15:27:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:27:40,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 15:27:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:40,668 INFO L225 Difference]: With dead ends: 344 [2025-01-09 15:27:40,668 INFO L226 Difference]: Without dead ends: 246 [2025-01-09 15:27:40,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:40,669 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 204 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:40,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 623 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 15:27:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-09 15:27:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 164. [2025-01-09 15:27:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 139 states have internal predecessors, (184), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:27:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 228 transitions. [2025-01-09 15:27:40,682 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 228 transitions. Word has length 104 [2025-01-09 15:27:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:40,682 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 228 transitions. [2025-01-09 15:27:40,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2025-01-09 15:27:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:40,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:40,683 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:40,692 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-01-09 15:27:40,888 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-01-09 15:27:40,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:40,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:40,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1490909888, now seen corresponding path program 1 times [2025-01-09 15:27:40,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:40,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302904756] [2025-01-09 15:27:40,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:40,889 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-01-09 15:27:40,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:40,892 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-01-09 15:27:40,893 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-01-09 15:27:40,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:41,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:41,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:41,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:41,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:27:41,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:41,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:41,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:41,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302904756] [2025-01-09 15:27:41,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302904756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:41,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:41,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:41,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119681181] [2025-01-09 15:27:41,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:41,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:41,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:41,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:41,170 INFO L87 Difference]: Start difference. First operand 164 states and 228 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:41,211 INFO L93 Difference]: Finished difference Result 267 states and 372 transitions. [2025-01-09 15:27:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:41,211 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 15:27:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:41,213 INFO L225 Difference]: With dead ends: 267 [2025-01-09 15:27:41,214 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 15:27:41,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 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-01-09 15:27:41,215 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 516 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-01-09 15:27:41,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 516 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 15:27:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2025-01-09 15:27:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3146853146853146) internal successors, (188), 143 states have internal predecessors, (188), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:27:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 232 transitions. [2025-01-09 15:27:41,228 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 232 transitions. Word has length 104 [2025-01-09 15:27:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:41,232 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 232 transitions. [2025-01-09 15:27:41,232 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 232 transitions. [2025-01-09 15:27:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:41,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:41,233 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:41,242 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-01-09 15:27:41,434 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-01-09 15:27:41,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:41,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2123999038, now seen corresponding path program 1 times [2025-01-09 15:27:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:41,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484669529] [2025-01-09 15:27:41,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:41,436 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-01-09 15:27:41,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:41,438 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-01-09 15:27:41,439 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-01-09 15:27:41,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:41,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:41,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:41,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:41,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:27:41,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:41,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:41,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:41,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484669529] [2025-01-09 15:27:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484669529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:41,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:41,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:41,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907077542] [2025-01-09 15:27:41,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:41,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:41,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:41,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:41,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:41,755 INFO L87 Difference]: Start difference. First operand 168 states and 232 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:41,841 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2025-01-09 15:27:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:41,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 15:27:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:41,842 INFO L225 Difference]: With dead ends: 273 [2025-01-09 15:27:41,842 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 15:27:41,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 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-01-09 15:27:41,843 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 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-01-09 15:27:41,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 15:27:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2025-01-09 15:27:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 145 states have internal predecessors, (190), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:27:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2025-01-09 15:27:41,852 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 234 transitions. Word has length 104 [2025-01-09 15:27:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:41,852 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 234 transitions. [2025-01-09 15:27:41,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 234 transitions. [2025-01-09 15:27:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:41,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:41,854 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:41,867 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-01-09 15:27:42,054 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-01-09 15:27:42,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:42,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash -348991676, now seen corresponding path program 1 times [2025-01-09 15:27:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:42,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894045516] [2025-01-09 15:27:42,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:42,056 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-01-09 15:27:42,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:42,059 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-01-09 15:27:42,060 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-01-09 15:27:42,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:42,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:42,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:42,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:42,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:27:42,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:42,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:42,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:42,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894045516] [2025-01-09 15:27:42,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894045516] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:42,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:42,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:27:42,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542561133] [2025-01-09 15:27:42,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:42,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:42,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:42,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:42,422 INFO L87 Difference]: Start difference. First operand 170 states and 234 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:42,478 INFO L93 Difference]: Finished difference Result 277 states and 381 transitions. [2025-01-09 15:27:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:27:42,479 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 15:27:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:42,480 INFO L225 Difference]: With dead ends: 277 [2025-01-09 15:27:42,480 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 15:27:42,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:42,481 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 755 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:42,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 15:27:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2025-01-09 15:27:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 147 states have internal predecessors, (192), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 15:27:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 236 transitions. [2025-01-09 15:27:42,489 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 236 transitions. Word has length 104 [2025-01-09 15:27:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:42,490 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 236 transitions. [2025-01-09 15:27:42,490 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 236 transitions. [2025-01-09 15:27:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:42,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:42,491 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:42,511 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-01-09 15:27:42,695 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-01-09 15:27:42,695 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:42,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash -347144634, now seen corresponding path program 1 times [2025-01-09 15:27:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:42,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440718173] [2025-01-09 15:27:42,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:42,697 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-01-09 15:27:42,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:42,700 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-01-09 15:27:42,701 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-01-09 15:27:42,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:42,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:42,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:42,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:42,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 15:27:42,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:42,973 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 20 treesize of output 16 [2025-01-09 15:27:43,081 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 63 treesize of output 51 [2025-01-09 15:27:43,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:43,086 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 72 treesize of output 44 [2025-01-09 15:27:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:43,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:43,120 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440718173] [2025-01-09 15:27:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440718173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:27:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258332786] [2025-01-09 15:27:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:43,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:27:43,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:43,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:27:43,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:43,122 INFO L87 Difference]: Start difference. First operand 172 states and 236 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:43,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:43,699 INFO L93 Difference]: Finished difference Result 460 states and 626 transitions. [2025-01-09 15:27:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:27:43,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 15:27:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:43,701 INFO L225 Difference]: With dead ends: 460 [2025-01-09 15:27:43,701 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 15:27:43,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:27:43,702 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 280 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:43,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 885 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 15:27:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 268. [2025-01-09 15:27:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 236 states have (on average 1.3177966101694916) internal successors, (311), 237 states have internal predecessors, (311), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 367 transitions. [2025-01-09 15:27:43,713 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 367 transitions. Word has length 104 [2025-01-09 15:27:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:43,713 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 367 transitions. [2025-01-09 15:27:43,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 367 transitions. [2025-01-09 15:27:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:43,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:43,714 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:43,726 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-01-09 15:27:43,919 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-01-09 15:27:43,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:43,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1368212988, now seen corresponding path program 1 times [2025-01-09 15:27:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:43,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548033981] [2025-01-09 15:27:43,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:43,920 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-01-09 15:27:43,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:43,923 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-01-09 15:27:43,923 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-01-09 15:27:44,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:44,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:44,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:44,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:44,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:27:44,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:44,285 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 19 treesize of output 11 [2025-01-09 15:27:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 15:27:44,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:44,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548033981] [2025-01-09 15:27:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548033981] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:44,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:44,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 15:27:44,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483136432] [2025-01-09 15:27:44,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:44,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:27:44,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:44,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:27:44,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:44,585 INFO L87 Difference]: Start difference. First operand 268 states and 367 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:44,726 INFO L93 Difference]: Finished difference Result 461 states and 632 transitions. [2025-01-09 15:27:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:27:44,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 15:27:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:44,730 INFO L225 Difference]: With dead ends: 461 [2025-01-09 15:27:44,730 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 15:27:44,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:44,731 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:44,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 15:27:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-01-09 15:27:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.315126050420168) internal successors, (313), 239 states have internal predecessors, (313), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 369 transitions. [2025-01-09 15:27:44,750 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 369 transitions. Word has length 104 [2025-01-09 15:27:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:44,750 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 369 transitions. [2025-01-09 15:27:44,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 369 transitions. [2025-01-09 15:27:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 15:27:44,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:44,753 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:44,761 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-01-09 15:27:44,953 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-01-09 15:27:44,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:44,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:44,954 INFO L85 PathProgramCache]: Analyzing trace with hash -481158140, now seen corresponding path program 1 times [2025-01-09 15:27:44,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:44,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936768811] [2025-01-09 15:27:44,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:44,955 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-01-09 15:27:44,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:44,957 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-01-09 15:27:44,958 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-01-09 15:27:45,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 15:27:45,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 15:27:45,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:45,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:45,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 15:27:45,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:45,295 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 17 treesize of output 13 [2025-01-09 15:27:45,299 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 24 treesize of output 16 [2025-01-09 15:27:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 15:27:45,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:45,717 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 19 treesize of output 15 [2025-01-09 15:27:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:45,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936768811] [2025-01-09 15:27:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936768811] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:45,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:45,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-01-09 15:27:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279830415] [2025-01-09 15:27:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:45,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:45,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:45,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:45,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:45,781 INFO L87 Difference]: Start difference. First operand 270 states and 369 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:45,889 INFO L93 Difference]: Finished difference Result 483 states and 662 transitions. [2025-01-09 15:27:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 15:27:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:45,891 INFO L225 Difference]: With dead ends: 483 [2025-01-09 15:27:45,891 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 15:27:45,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:45,892 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 25 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:45,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 419 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 15:27:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 271. [2025-01-09 15:27:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 240 states have internal predecessors, (313), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 369 transitions. [2025-01-09 15:27:45,902 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 369 transitions. Word has length 104 [2025-01-09 15:27:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:45,902 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 369 transitions. [2025-01-09 15:27:45,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 369 transitions. [2025-01-09 15:27:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:27:45,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:45,903 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:45,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 (11)] Ended with exit code 0 [2025-01-09 15:27:46,108 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-01-09 15:27:46,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:46,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:46,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1117385751, now seen corresponding path program 1 times [2025-01-09 15:27:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:46,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496585862] [2025-01-09 15:27:46,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:46,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:27:46,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:46,111 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-01-09 15:27:46,112 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-01-09 15:27:46,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:27:46,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:27:46,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:46,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:46,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:27:46,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:46,387 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-01-09 15:27:46,767 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 19 treesize of output 11 [2025-01-09 15:27:46,852 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 37 treesize of output 25 [2025-01-09 15:27:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 15:27:46,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:48,734 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 41 treesize of output 29 [2025-01-09 15:27:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:48,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:48,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496585862] [2025-01-09 15:27:48,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496585862] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:48,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:48,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2025-01-09 15:27:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120177040] [2025-01-09 15:27:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:48,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:48,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:48,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:27:48,806 INFO L87 Difference]: Start difference. First operand 271 states and 369 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:53,041 INFO L93 Difference]: Finished difference Result 579 states and 786 transitions. [2025-01-09 15:27:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:27:53,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-01-09 15:27:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:53,052 INFO L225 Difference]: With dead ends: 579 [2025-01-09 15:27:53,052 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 15:27:53,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:27:53,053 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 62 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:53,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 704 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 15:27:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 15:27:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 295. [2025-01-09 15:27:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 263 states have (on average 1.3346007604562737) internal successors, (351), 264 states have internal predecessors, (351), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 407 transitions. [2025-01-09 15:27:53,070 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 407 transitions. Word has length 105 [2025-01-09 15:27:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:53,070 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 407 transitions. [2025-01-09 15:27:53,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 407 transitions. [2025-01-09 15:27:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:27:53,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:53,071 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:53,082 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-01-09 15:27:53,272 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-01-09 15:27:53,272 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:53,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2015964581, now seen corresponding path program 1 times [2025-01-09 15:27:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:53,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362719539] [2025-01-09 15:27:53,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:53,273 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-01-09 15:27:53,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:53,275 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-01-09 15:27:53,277 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-01-09 15:27:53,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:27:53,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:27:53,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:53,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:53,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:27:53,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:53,543 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-01-09 15:27:53,744 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 17 treesize of output 13 [2025-01-09 15:27:53,747 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 24 treesize of output 16 [2025-01-09 15:27:54,102 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 37 treesize of output 25 [2025-01-09 15:27:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 15:27:54,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:54,510 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 32 treesize of output 20 [2025-01-09 15:27:54,648 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 22 treesize of output 18 [2025-01-09 15:27:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:54,727 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:54,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362719539] [2025-01-09 15:27:54,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362719539] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:54,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:54,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-01-09 15:27:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743587513] [2025-01-09 15:27:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:54,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:54,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:54,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:54,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:27:54,729 INFO L87 Difference]: Start difference. First operand 295 states and 407 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:55,537 INFO L93 Difference]: Finished difference Result 501 states and 690 transitions. [2025-01-09 15:27:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-01-09 15:27:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:55,541 INFO L225 Difference]: With dead ends: 501 [2025-01-09 15:27:55,541 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 15:27:55,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:27:55,542 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 26 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:55,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 543 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:27:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 15:27:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-01-09 15:27:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 249 states have (on average 1.3172690763052208) internal successors, (328), 250 states have internal predecessors, (328), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 384 transitions. [2025-01-09 15:27:55,551 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 384 transitions. Word has length 105 [2025-01-09 15:27:55,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:55,551 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 384 transitions. [2025-01-09 15:27:55,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:55,552 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 384 transitions. [2025-01-09 15:27:55,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:27:55,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:55,552 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:55,563 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-01-09 15:27:55,757 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-01-09 15:27:55,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:55,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1179425365, now seen corresponding path program 1 times [2025-01-09 15:27:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:55,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57667157] [2025-01-09 15:27:55,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:55,758 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-01-09 15:27:55,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:55,761 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-01-09 15:27:55,762 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-01-09 15:27:55,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:27:55,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:27:55,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:55,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:55,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:27:55,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:56,007 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-01-09 15:27:56,226 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 28 treesize of output 16 [2025-01-09 15:27:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 15:27:56,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:56,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:27:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57667157] [2025-01-09 15:27:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57667157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:56,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:56,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:56,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576345636] [2025-01-09 15:27:56,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:56,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:56,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:27:56,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:56,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:56,321 INFO L87 Difference]: Start difference. First operand 281 states and 384 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:57,923 INFO L93 Difference]: Finished difference Result 652 states and 884 transitions. [2025-01-09 15:27:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:27:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-01-09 15:27:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:57,932 INFO L225 Difference]: With dead ends: 652 [2025-01-09 15:27:57,932 INFO L226 Difference]: Without dead ends: 446 [2025-01-09 15:27:57,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:57,937 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 275 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:57,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 602 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 15:27:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-01-09 15:27:57,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 284. [2025-01-09 15:27:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 252 states have (on average 1.3214285714285714) internal successors, (333), 253 states have internal predecessors, (333), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:27:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 389 transitions. [2025-01-09 15:27:57,960 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 389 transitions. Word has length 105 [2025-01-09 15:27:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:57,960 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 389 transitions. [2025-01-09 15:27:57,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 15:27:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 389 transitions. [2025-01-09 15:27:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:27:57,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:57,961 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:27:57,970 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-01-09 15:27:58,161 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-01-09 15:27:58,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:58,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1031488463, now seen corresponding path program 1 times [2025-01-09 15:27:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:27:58,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036779657] [2025-01-09 15:27:58,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:58,162 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-01-09 15:27:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:27:58,165 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-01-09 15:27:58,166 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-01-09 15:27:58,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:27:58,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:27:58,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:58,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:58,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:27:58,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:58,588 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-01-09 15:27:58,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:27:58,813 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 133 treesize of output 79 [2025-01-09 15:28:03,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:03,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 105 [2025-01-09 15:28:11,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:11,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 230 treesize of output 152 [2025-01-09 15:28:12,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:12,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 438 treesize of output 150 [2025-01-09 15:28:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 32 proven. 72 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 15:28:12,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:12,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:28:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036779657] [2025-01-09 15:28:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036779657] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1408715272] [2025-01-09 15:28:12,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:12,817 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:28:12,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:28:12,835 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:28:12,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-01-09 15:28:12,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:28:14,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:28:14,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:14,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:14,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 15:28:14,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:14,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 15:28:22,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:22,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 71 [2025-01-09 15:28:35,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:35,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 96