./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/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-26.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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e'] 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-26.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 c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:10:55,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:10:55,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:10:55,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:10:55,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:10:55,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:10:55,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:10:55,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:10:55,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:10:55,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:10:55,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:10:55,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:10:55,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:10:55,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:10:55,766 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:10:55,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:10:55,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:10:55,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:10:55,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:10:55,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:10:55,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:10:55,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:10:55,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:10:55,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:55,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:10:55,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:10:55,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:10:55,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:10:55,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:10:55,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:10:55,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:10:55,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:10:55,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:10:55,769 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 -> c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e [2024-11-07 10:10:56,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:10:56,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:10:56,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:10:56,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:10:56,013 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:10:56,014 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-26.i [2024-11-07 10:10:57,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:10:57,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:10:57,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i [2024-11-07 10:10:57,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27686c13c/1e27a414ca37404b9991f2d073c90aec/FLAG2b2773ace [2024-11-07 10:10:57,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27686c13c/1e27a414ca37404b9991f2d073c90aec [2024-11-07 10:10:57,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:10:57,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:10:57,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:57,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:10:57,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:10:57,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:57" (1/1) ... [2024-11-07 10:10:57,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@477c661f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:57, skipping insertion in model container [2024-11-07 10:10:57,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:57" (1/1) ... [2024-11-07 10:10:57,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:10:57,976 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-26.i[916,929] [2024-11-07 10:10:58,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:58,027 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:10:58,036 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-26.i[916,929] [2024-11-07 10:10:58,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:58,074 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:10:58,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58 WrapperNode [2024-11-07 10:10:58,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:58,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:58,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:10:58,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:10:58,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,120 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2024-11-07 10:10:58,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:58,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:10:58,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:10:58,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:10:58,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,153 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2024-11-07 10:10:58,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:10:58,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:10:58,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:10:58,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:10:58,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (1/1) ... [2024-11-07 10:10:58,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:58,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:58,206 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) [2024-11-07 10:10:58,222 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 [2024-11-07 10:10:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:10:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:10:58,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:10:58,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:10:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:10:58,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:10:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:10:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:10:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:10:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:10:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:10:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:10:58,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:10:58,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:10:58,356 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:10:58,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:10:58,745 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-07 10:10:58,745 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:10:58,755 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:10:58,755 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:10:58,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:58 BoogieIcfgContainer [2024-11-07 10:10:58,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:10:58,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:10:58,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:10:58,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:10:58,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:57" (1/3) ... [2024-11-07 10:10:58,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30959c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:58, skipping insertion in model container [2024-11-07 10:10:58,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:58" (2/3) ... [2024-11-07 10:10:58,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30959c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:58, skipping insertion in model container [2024-11-07 10:10:58,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:58" (3/3) ... [2024-11-07 10:10:58,762 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-26.i [2024-11-07 10:10:58,771 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:10:58,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:10:58,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:10:58,825 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;@5ab03e5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:10:58,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:10:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:10:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:10:58,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:58,839 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:10:58,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:58,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:58,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1509494359, now seen corresponding path program 1 times [2024-11-07 10:10:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:58,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224683176] [2024-11-07 10:10:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:10:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:10:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:10:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:10:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:59,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224683176] [2024-11-07 10:10:59,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224683176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:59,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:10:59,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216434243] [2024-11-07 10:10:59,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:59,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:10:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:59,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:10:59,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:10:59,184 INFO L87 Difference]: Start difference. First operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:10:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:59,208 INFO L93 Difference]: Finished difference Result 179 states and 271 transitions. [2024-11-07 10:10:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:10:59,210 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-07 10:10:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:59,216 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:10:59,217 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:10:59,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:10:59,223 INFO L432 NwaCegarLoop]: 127 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, 127 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 [2024-11-07 10:10:59,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:10:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-07 10:10:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:10:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-07 10:10:59,262 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2024-11-07 10:10:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:59,262 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-07 10:10:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:10:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-07 10:10:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:10:59,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:59,268 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:10:59,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:10:59,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:59,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:59,269 INFO L85 PathProgramCache]: Analyzing trace with hash 359888411, now seen corresponding path program 1 times [2024-11-07 10:10:59,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:59,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755285293] [2024-11-07 10:10:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:59,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:10:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:10:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:10:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:10:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755285293] [2024-11-07 10:10:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755285293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:59,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:59,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:10:59,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782959049] [2024-11-07 10:10:59,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:59,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:10:59,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:59,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:10:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:10:59,546 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:10:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:59,597 INFO L93 Difference]: Finished difference Result 178 states and 255 transitions. [2024-11-07 10:10:59,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:10:59,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-07 10:10:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:59,598 INFO L225 Difference]: With dead ends: 178 [2024-11-07 10:10:59,599 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:10:59,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:10:59,600 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:59,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:10:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-07 10:10:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:10:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-11-07 10:10:59,606 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2024-11-07 10:10:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:59,607 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-11-07 10:10:59,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:10:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-11-07 10:10:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:10:59,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:59,609 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:10:59,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:10:59,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:59,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash 361735453, now seen corresponding path program 1 times [2024-11-07 10:10:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636080290] [2024-11-07 10:10:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:59,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:10:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:10:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:10:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:10:59,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636080290] [2024-11-07 10:10:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636080290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:10:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494599100] [2024-11-07 10:10:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:59,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:10:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:59,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:10:59,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:10:59,988 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:00,070 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2024-11-07 10:11:00,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:11:00,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-07 10:11:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:00,073 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:11:00,074 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:11:00,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:00,074 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:00,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:11:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:11:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 10:11:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-07 10:11:00,085 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 89 [2024-11-07 10:11:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:00,086 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-07 10:11:00,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-07 10:11:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:11:00,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:00,087 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:00,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:11:00,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:00,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash -455912997, now seen corresponding path program 1 times [2024-11-07 10:11:00,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:11:00,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374837173] [2024-11-07 10:11:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:00,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:11:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:11:00,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972404432] [2024-11-07 10:11:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:11:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:11:00,251 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) [2024-11-07 10:11:00,256 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 [2024-11-07 10:11:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:11:00,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:11:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:11:00,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:11:00,863 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:11:00,864 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:11:00,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:11:01,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:11:01,068 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 10:11:01,114 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:11:01,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:11:01 BoogieIcfgContainer [2024-11-07 10:11:01,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:11:01,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:11:01,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:11:01,118 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:11:01,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:58" (3/4) ... [2024-11-07 10:11:01,120 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:11:01,120 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:11:01,121 INFO L158 Benchmark]: Toolchain (without parser) took 3256.87ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 36.1MB in the end (delta: 40.2MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-11-07 10:11:01,121 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:11:01,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.96ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 61.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:11:01,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.84ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 56.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:11:01,122 INFO L158 Benchmark]: Boogie Preprocessor took 54.50ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 52.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:11:01,122 INFO L158 Benchmark]: RCFGBuilder took 579.64ms. Allocated memory is still 100.7MB. Free memory was 52.1MB in the beginning and 54.2MB in the end (delta: -2.2MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-07 10:11:01,122 INFO L158 Benchmark]: TraceAbstraction took 2360.04ms. Allocated memory is still 100.7MB. Free memory was 53.8MB in the beginning and 36.1MB in the end (delta: 17.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-07 10:11:01,122 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 100.7MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 18.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:11:01,123 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.28ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.96ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 61.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.84ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 56.9MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.50ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 52.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 579.64ms. Allocated memory is still 100.7MB. Free memory was 52.1MB in the beginning and 54.2MB in the end (delta: -2.2MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2360.04ms. Allocated memory is still 100.7MB. Free memory was 53.8MB in the beginning and 36.1MB in the end (delta: 17.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 100.7MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 18.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryArithmeticFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L22-L24] float float_Array_0[2][2] = { {8.75, 199.5}, {1.125, 100000000000000.3} }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -32 }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -32 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { 1, -1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 2, 64 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 50 }; [L37] unsigned char last_1_unsigned_char_Array_0_1_ = 64; VAL [float_Array_0={4:0}, isInitial=0, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] CALL updateLastVariables() [L73] EXPR unsigned_char_Array_0[1] [L73] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L83] RET updateLastVariables() [L84] CALL updateVariables() [L57] float_Array_0[0][1] = __VERIFIER_nondet_float() [L58] EXPR float_Array_0[0][1] [L58] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L58] EXPR float_Array_0[0][1] [L58] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L58] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] float_Array_0[1][1] = __VERIFIER_nondet_float() [L60] EXPR float_Array_0[1][1] [L60] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F [L60] EXPR float_Array_0[1][1] [L60] EXPR float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] EXPR (float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] CALL assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] RET assume_abort_if_not((float_Array_0[1][1] >= -461168.6018427382800e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 4611686.018427382800e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L61] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L62] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L62] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L63] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L64] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L65] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L66] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L66] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L67] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET updateVariables() [L85] CALL step() [L41] EXPR float_Array_0[0][1] [L41] EXPR float_Array_0[1][1] [L41] float_Array_0[1][0] = ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]) [L42] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L42] COND TRUE (- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4)))) [L43] EXPR unsigned_char_Array_0[0] [L43] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L45] EXPR float_Array_0[0][1] [L45] float_Array_0[0][0] = float_Array_0[0][1] [L46] EXPR float_Array_0[0][0] [L46] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L46] COND TRUE float_Array_0[0][0] > float_Array_0[0][0] [L47] EXPR unsigned_char_Array_0[1] [L47] EXPR unsigned_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L47] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) [L47] EXPR unsigned_char_Array_0[1] [L47] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L47] signed_short_int_Array_0[1] = ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_short_int_Array_0[1] [L51] signed long int stepLocal_0 = unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1]); [L52] EXPR unsigned_char_Array_0[1] [L52] EXPR signed_short_int_Array_0[1] [L52] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L52] COND FALSE !(stepLocal_0 != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) [L85] RET step() [L86] CALL, EXPR property() [L76] EXPR float_Array_0[0][0] [L76] EXPR float_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))))) [L76] EXPR signed_short_int_Array_0[1] [L76] EXPR unsigned_char_Array_0[1] [L76] EXPR unsigned_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) [L76] EXPR unsigned_char_Array_0[1] [L76] EXPR ((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]))) [L76] EXPR float_Array_0[1][0] [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[1][1] [L76] EXPR ((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1]))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR ((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1)) && (float_Array_0[0][0] == ((float) float_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1)) && (float_Array_0[0][0] == ((float) float_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76-L77] return (((((float_Array_0[0][0] > float_Array_0[0][0]) ? (signed_short_int_Array_0[1] == ((signed short int) ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : (signed_short_int_Array_0[1] == ((signed short int) (((((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) < ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))) ? ((unsigned_char_Array_0[1] - ((((unsigned_char_Array_0[1]) > (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))) : ((unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < (unsigned_char_Array_0[1])) ? (unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))))) && (float_Array_0[1][0] == ((float) ((0.85f - float_Array_0[0][1]) + float_Array_0[1][1])))) && (((- last_1_unsigned_char_Array_0_1_) >= (signed_short_int_Array_0[0] / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1)) && (((unsigned_char_Array_0[1] + (unsigned_char_Array_0[1] + signed_short_int_Array_0[1])) != (unsigned_char_Array_0[1] * (signed_short_int_Array_0[1] / signed_long_int_Array_0[0]))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (((((10u) < ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1]))) ? (10u) : ((signed_short_int_Array_0[1] + unsigned_char_Array_0[1])))) + unsigned_char_Array_0[1]))) : 1)) && (float_Array_0[0][0] == ((float) float_Array_0[0][1])) ; [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=64, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 695 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 319 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 376 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:11:01,144 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-26.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 c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:11:03,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:11:03,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:11:03,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:11:03,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:11:03,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:11:03,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:11:03,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:11:03,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:11:03,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:11:03,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:11:03,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:11:03,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:11:03,462 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:11:03,463 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:11:03,463 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:11:03,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:11:03,463 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:11:03,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:11:03,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:11:03,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:11:03,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:11:03,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:11:03,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:11:03,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:11:03,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:11:03,468 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:11:03,469 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:11:03,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:11:03,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:11:03,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:11:03,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:11:03,469 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-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 -> c6953e3e2c891dc327bad9ef4ac79fcd91ec8cfbe2ca26df68844c164258e82e [2024-11-07 10:11:03,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:11:03,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:11:03,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:11:03,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:11:03,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:11:03,759 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-26.i [2024-11-07 10:11:05,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:11:05,288 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:11:05,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-26.i [2024-11-07 10:11:05,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/579e868d5/1d1ccd3685124d7fb6db1e16ecf95ccb/FLAG2dc63ecb6 [2024-11-07 10:11:05,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/579e868d5/1d1ccd3685124d7fb6db1e16ecf95ccb [2024-11-07 10:11:05,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:11:05,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:11:05,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:11:05,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:11:05,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:11:05,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626b961a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05, skipping insertion in model container [2024-11-07 10:11:05,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:11:05,422 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-26.i[916,929] [2024-11-07 10:11:05,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:11:05,500 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:11:05,509 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-26.i[916,929] [2024-11-07 10:11:05,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:11:05,584 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:11:05,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05 WrapperNode [2024-11-07 10:11:05,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:11:05,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:11:05,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:11:05,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:11:05,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,645 INFO L138 Inliner]: procedures = 36, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2024-11-07 10:11:05,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:11:05,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:11:05,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:11:05,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:11:05,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,686 INFO L175 MemorySlicer]: Split 129 memory accesses to 6 slices as follows [2, 28, 7, 19, 70, 3]. 54 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 4, 1, 2, 2, 1]. The 11 writes are split as follows [0, 4, 1, 3, 2, 1]. [2024-11-07 10:11:05,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:11:05,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:11:05,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:11:05,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:11:05,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (1/1) ... [2024-11-07 10:11:05,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:11:05,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:11:05,746 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) [2024-11-07 10:11:05,753 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 [2024-11-07 10:11:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:11:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:11:05,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:11:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:11:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-07 10:11:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:11:05,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:11:05,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 10:11:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-07 10:11:05,908 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:11:05,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:11:07,120 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-11-07 10:11:07,120 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:11:07,133 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:11:07,133 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:11:07,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:07 BoogieIcfgContainer [2024-11-07 10:11:07,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:11:07,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:11:07,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:11:07,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:11:07,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:11:05" (1/3) ... [2024-11-07 10:11:07,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d51fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:07, skipping insertion in model container [2024-11-07 10:11:07,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:11:05" (2/3) ... [2024-11-07 10:11:07,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d51fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:11:07, skipping insertion in model container [2024-11-07 10:11:07,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:11:07" (3/3) ... [2024-11-07 10:11:07,144 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-26.i [2024-11-07 10:11:07,158 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:11:07,158 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:11:07,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:11:07,215 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;@13a95ba5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:11:07,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:11:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:11:07,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:07,227 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:07,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:07,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:07,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1509494359, now seen corresponding path program 1 times [2024-11-07 10:11:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:07,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594790697] [2024-11-07 10:11:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:07,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:07,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:07,246 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) [2024-11-07 10:11:07,247 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 [2024-11-07 10:11:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:07,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:11:07,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-07 10:11:07,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:07,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594790697] [2024-11-07 10:11:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594790697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:07,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:11:07,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908377599] [2024-11-07 10:11:07,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:07,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:11:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:11:07,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:11:07,677 INFO L87 Difference]: Start difference. First operand has 93 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:07,693 INFO L93 Difference]: Finished difference Result 179 states and 271 transitions. [2024-11-07 10:11:07,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:11:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-07 10:11:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:07,699 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:11:07,699 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:11:07,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:11:07,703 INFO L432 NwaCegarLoop]: 127 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, 127 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 [2024-11-07 10:11:07,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:11:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:11:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-07 10:11:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-07 10:11:07,730 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2024-11-07 10:11:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:07,731 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-07 10:11:07,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-07 10:11:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:11:07,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:07,733 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:07,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:11:07,937 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 [2024-11-07 10:11:07,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:07,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash 359888411, now seen corresponding path program 1 times [2024-11-07 10:11:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584298331] [2024-11-07 10:11:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:07,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:07,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:07,942 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) [2024-11-07 10:11:07,944 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 [2024-11-07 10:11:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:08,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:11:08,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:11:08,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:08,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584298331] [2024-11-07 10:11:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584298331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:08,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:08,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111946583] [2024-11-07 10:11:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:08,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:11:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:11:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:11:08,475 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:08,538 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2024-11-07 10:11:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:11:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-07 10:11:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:08,540 INFO L225 Difference]: With dead ends: 180 [2024-11-07 10:11:08,541 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 10:11:08,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:11:08,542 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:08,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:11:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 10:11:08,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-07 10:11:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-11-07 10:11:08,550 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 89 [2024-11-07 10:11:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:08,551 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-11-07 10:11:08,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-11-07 10:11:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:11:08,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:08,552 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:08,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 (3)] Ended with exit code 0 [2024-11-07 10:11:08,756 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 [2024-11-07 10:11:08,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:08,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash 361735453, now seen corresponding path program 1 times [2024-11-07 10:11:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410251113] [2024-11-07 10:11:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:08,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 [2024-11-07 10:11:08,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:08,761 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) [2024-11-07 10:11:08,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 (4)] Waiting until timeout for monitored process [2024-11-07 10:11:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:09,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:11:09,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:09,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-07 10:11:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:11:09,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:09,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:09,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410251113] [2024-11-07 10:11:09,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410251113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:09,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:09,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:09,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767680068] [2024-11-07 10:11:09,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:09,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:09,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:09,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:09,211 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:09,928 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-11-07 10:11:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:09,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2024-11-07 10:11:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:09,930 INFO L225 Difference]: With dead ends: 184 [2024-11-07 10:11:09,930 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 10:11:09,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:11:09,931 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 121 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:09,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 434 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:11:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 10:11:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-07 10:11:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-07 10:11:09,941 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 89 [2024-11-07 10:11:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:09,941 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-07 10:11:09,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-07 10:11:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 10:11:09,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:09,943 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:09,956 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 [2024-11-07 10:11:10,143 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 [2024-11-07 10:11:10,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:10,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1492377065, now seen corresponding path program 1 times [2024-11-07 10:11:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:10,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032227499] [2024-11-07 10:11:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:10,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:10,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:10,148 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) [2024-11-07 10:11:10,149 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 [2024-11-07 10:11:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:10,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:11:10,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:10,457 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 [2024-11-07 10:11:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:11:10,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:10,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:10,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032227499] [2024-11-07 10:11:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032227499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:10,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:11:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124753727] [2024-11-07 10:11:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:10,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:11:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:11:10,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:10,483 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:10,764 INFO L93 Difference]: Finished difference Result 183 states and 257 transitions. [2024-11-07 10:11:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:11:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-07 10:11:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:10,767 INFO L225 Difference]: With dead ends: 183 [2024-11-07 10:11:10,767 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 10:11:10,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:10,770 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:10,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:11:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 10:11:10,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 10:11:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2024-11-07 10:11:10,781 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 91 [2024-11-07 10:11:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:10,783 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2024-11-07 10:11:10,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2024-11-07 10:11:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 10:11:10,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:10,784 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:10,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 10:11:10,985 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 [2024-11-07 10:11:10,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:10,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1984941781, now seen corresponding path program 1 times [2024-11-07 10:11:10,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:10,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145656787] [2024-11-07 10:11:10,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:10,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:10,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:10,989 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) [2024-11-07 10:11:10,991 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 [2024-11-07 10:11:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:11,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:11:11,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:11,355 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 43 treesize of output 19 [2024-11-07 10:11:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:11:11,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:11,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145656787] [2024-11-07 10:11:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [145656787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:11,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:11,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:11:11,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481920200] [2024-11-07 10:11:11,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:11,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:11:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:11:11,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:11,391 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:11,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:11,808 INFO L93 Difference]: Finished difference Result 181 states and 253 transitions. [2024-11-07 10:11:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:11:11,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-07 10:11:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:11,809 INFO L225 Difference]: With dead ends: 181 [2024-11-07 10:11:11,809 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:11:11,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:11,810 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:11,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:11:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:11:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 10:11:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2024-11-07 10:11:11,816 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 91 [2024-11-07 10:11:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:11,817 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2024-11-07 10:11:11,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2024-11-07 10:11:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:11:11,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:11,818 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:11,833 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 [2024-11-07 10:11:12,025 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 [2024-11-07 10:11:12,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:12,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1660065302, now seen corresponding path program 1 times [2024-11-07 10:11:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:12,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565787384] [2024-11-07 10:11:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:12,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:12,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:12,030 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) [2024-11-07 10:11:12,041 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 [2024-11-07 10:11:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:12,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:11:12,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:11:12,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:12,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565787384] [2024-11-07 10:11:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565787384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:12,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:12,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:11:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017503446] [2024-11-07 10:11:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:12,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:11:12,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:12,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:11:12,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:12,437 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:12,844 INFO L93 Difference]: Finished difference Result 179 states and 249 transitions. [2024-11-07 10:11:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:11:12,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-07 10:11:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:12,846 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:11:12,846 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:11:12,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:12,847 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:12,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:11:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:11:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 10:11:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2024-11-07 10:11:12,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 96 [2024-11-07 10:11:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:12,852 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2024-11-07 10:11:12,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2024-11-07 10:11:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:11:12,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:12,853 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:12,863 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 [2024-11-07 10:11:13,057 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 [2024-11-07 10:11:13,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:13,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1800613912, now seen corresponding path program 1 times [2024-11-07 10:11:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:13,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610893776] [2024-11-07 10:11:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:13,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:13,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:13,061 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) [2024-11-07 10:11:13,062 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 [2024-11-07 10:11:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:13,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:11:13,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:11:13,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:13,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:13,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610893776] [2024-11-07 10:11:13,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610893776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:13,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:13,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:11:13,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204279121] [2024-11-07 10:11:13,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:13,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:11:13,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:13,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:11:13,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:13,389 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:13,730 INFO L93 Difference]: Finished difference Result 179 states and 247 transitions. [2024-11-07 10:11:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:11:13,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-07 10:11:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:13,732 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:11:13,732 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:11:13,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:13,733 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:13,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:11:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:11:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 10:11:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2024-11-07 10:11:13,737 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 96 [2024-11-07 10:11:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:13,737 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2024-11-07 10:11:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2024-11-07 10:11:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:11:13,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:13,739 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:13,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-07 10:11:13,939 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 [2024-11-07 10:11:13,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:13,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:13,940 INFO L85 PathProgramCache]: Analyzing trace with hash -4824422, now seen corresponding path program 1 times [2024-11-07 10:11:13,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:13,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790097959] [2024-11-07 10:11:13,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:13,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:13,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:13,943 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) [2024-11-07 10:11:13,944 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 [2024-11-07 10:11:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:14,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:11:14,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:11:14,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:14,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:14,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790097959] [2024-11-07 10:11:14,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790097959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:14,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:14,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:11:14,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597357664] [2024-11-07 10:11:14,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:14,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:11:14,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:14,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:11:14,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:14,305 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:14,624 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2024-11-07 10:11:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:11:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-07 10:11:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:14,626 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:11:14,626 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:11:14,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:11:14,626 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:14,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:11:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:11:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 10:11:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:11:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-07 10:11:14,635 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 96 [2024-11-07 10:11:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-07 10:11:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-07 10:11:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:11:14,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:14,636 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:14,647 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 [2024-11-07 10:11:14,840 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 [2024-11-07 10:11:14,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:14,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 417877404, now seen corresponding path program 1 times [2024-11-07 10:11:14,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:14,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033009816] [2024-11-07 10:11:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:14,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:14,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:14,844 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) [2024-11-07 10:11:14,846 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 [2024-11-07 10:11:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:15,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 10:11:15,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:15,414 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 34 treesize of output 30 [2024-11-07 10:11:15,501 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 [2024-11-07 10:11:15,551 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 69 treesize of output 33 [2024-11-07 10:11:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:11:15,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:15,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:15,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033009816] [2024-11-07 10:11:15,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033009816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:15,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:15,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:11:15,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282798460] [2024-11-07 10:11:15,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:15,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:11:15,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:15,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:11:15,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:11:15,690 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:18,335 INFO L93 Difference]: Finished difference Result 270 states and 366 transitions. [2024-11-07 10:11:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 10:11:18,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-07 10:11:18,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:18,337 INFO L225 Difference]: With dead ends: 270 [2024-11-07 10:11:18,337 INFO L226 Difference]: Without dead ends: 182 [2024-11-07 10:11:18,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:11:18,339 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 111 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:18,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1163 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 10:11:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-07 10:11:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2024-11-07 10:11:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3116883116883118) internal successors, (202), 154 states have internal predecessors, (202), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:11:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 238 transitions. [2024-11-07 10:11:18,355 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 238 transitions. Word has length 96 [2024-11-07 10:11:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:18,355 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 238 transitions. [2024-11-07 10:11:18,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:11:18,355 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 238 transitions. [2024-11-07 10:11:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:11:18,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:18,356 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:18,368 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 [2024-11-07 10:11:18,558 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 [2024-11-07 10:11:18,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:18,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:18,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1118941982, now seen corresponding path program 1 times [2024-11-07 10:11:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:18,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057065537] [2024-11-07 10:11:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:18,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:18,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:18,563 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) [2024-11-07 10:11:18,564 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 [2024-11-07 10:11:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:19,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 10:11:19,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:19,442 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 34 treesize of output 30 [2024-11-07 10:11:19,528 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 16 treesize of output 8 [2024-11-07 10:11:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-07 10:11:19,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:11:34,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:34,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057065537] [2024-11-07 10:11:34,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057065537] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:11:34,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:11:34,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 25 [2024-11-07 10:11:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263307197] [2024-11-07 10:11:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:34,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:11:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:11:34,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:11:34,472 INFO L87 Difference]: Start difference. First operand 175 states and 238 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)