./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.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-20.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', 'abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12'] 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-20.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 abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:10:09,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:10:09,645 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:09,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:10:09,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:10:09,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:10:09,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:10:09,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:10:09,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:10:09,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:10:09,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:10:09,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:10:09,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:10:09,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:10:09,677 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:10:09,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:10:09,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:10:09,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:10:09,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:10:09,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:10:09,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:10:09,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:10:09,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:10:09,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:10:09,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:10:09,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:10:09,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:10:09,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:10:09,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:10:09,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:10:09,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:10:09,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:10:09,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:09,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:10:09,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:10:09,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:10:09,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:10:09,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:10:09,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:10:09,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:10:09,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:10:09,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:10:09,682 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 -> abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 [2024-11-07 10:10:09,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:10:09,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:10:09,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:10:09,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:10:09,989 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:10:09,990 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-20.i [2024-11-07 10:10:11,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:10:11,605 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:10:11,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2024-11-07 10:10:11,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/872eaa6f4/88ad07e36a344f98bf947015ca873670/FLAG1e0ad59d9 [2024-11-07 10:10:11,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/872eaa6f4/88ad07e36a344f98bf947015ca873670 [2024-11-07 10:10:11,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:10:11,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:10:11,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:11,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:10:11,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:10:11,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:11" (1/1) ... [2024-11-07 10:10:11,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f173b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:11, skipping insertion in model container [2024-11-07 10:10:11,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:11" (1/1) ... [2024-11-07 10:10:11,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:10:12,076 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-20.i[916,929] [2024-11-07 10:10:12,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:12,163 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:10:12,171 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-20.i[916,929] [2024-11-07 10:10:12,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:12,222 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:10:12,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:12 WrapperNode [2024-11-07 10:10:12,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:12,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:12,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:10:12,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:10:12,231 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:12" (1/1) ... [2024-11-07 10:10:12,250 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:12" (1/1) ... [2024-11-07 10:10:12,308 INFO L138 Inliner]: procedures = 29, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-11-07 10:10:12,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:12,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:10:12,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:10:12,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:10:12,324 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:12" (1/1) ... [2024-11-07 10:10:12,324 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:12" (1/1) ... [2024-11-07 10:10:12,334 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:12" (1/1) ... [2024-11-07 10:10:12,367 INFO L175 MemorySlicer]: Split 136 memory accesses to 6 slices as follows [2, 14, 13, 45, 33, 29]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 5, 3, 4]. The 20 writes are split as follows [0, 2, 2, 6, 5, 5]. [2024-11-07 10:10:12,371 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:12" (1/1) ... [2024-11-07 10:10:12,371 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:12" (1/1) ... [2024-11-07 10:10:12,399 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:12" (1/1) ... [2024-11-07 10:10:12,410 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:12" (1/1) ... [2024-11-07 10:10:12,415 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:12" (1/1) ... [2024-11-07 10:10:12,421 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:12" (1/1) ... [2024-11-07 10:10:12,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:10:12,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:10:12,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:10:12,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:10:12,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:12" (1/1) ... [2024-11-07 10:10:12,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:12,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:12,469 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:12,473 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:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:10:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:10:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:10:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:10:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:10:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:10:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:10:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:10:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:10:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:10:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:10:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:10:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:10:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:10:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:10:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:10:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:10:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:10:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:10:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:10:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:10:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:10:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:10:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:10:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:10:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:10:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:10:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:10:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:10:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:10:12,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:10:12,637 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:10:12,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:10:13,147 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-07 10:10:13,147 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:10:13,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:10:13,162 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:10:13,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:13 BoogieIcfgContainer [2024-11-07 10:10:13,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:10:13,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:10:13,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:10:13,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:10:13,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:11" (1/3) ... [2024-11-07 10:10:13,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63734926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:13, skipping insertion in model container [2024-11-07 10:10:13,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:12" (2/3) ... [2024-11-07 10:10:13,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63734926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:13, skipping insertion in model container [2024-11-07 10:10:13,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:13" (3/3) ... [2024-11-07 10:10:13,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-20.i [2024-11-07 10:10:13,189 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:10:13,190 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:10:13,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:10:13,263 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;@1557684d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:10:13,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:10:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:10:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 10:10:13,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:13,280 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:13,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1837224321, now seen corresponding path program 1 times [2024-11-07 10:10:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725329559] [2024-11-07 10:10:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:10:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:10:13,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:13,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725329559] [2024-11-07 10:10:13,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725329559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:13,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:13,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:10:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072709764] [2024-11-07 10:10:13,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:13,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:10:13,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:13,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:10:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:10:13,793 INFO L87 Difference]: Start difference. First operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:13,825 INFO L93 Difference]: Finished difference Result 219 states and 347 transitions. [2024-11-07 10:10:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:10:13,827 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-07 10:10:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:13,832 INFO L225 Difference]: With dead ends: 219 [2024-11-07 10:10:13,833 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 10:10:13,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:13,841 INFO L432 NwaCegarLoop]: 156 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, 156 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:13,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 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:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 10:10:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 10:10:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:10:13,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-07 10:10:13,882 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 152 [2024-11-07 10:10:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:13,882 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-07 10:10:13,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-07 10:10:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 10:10:13,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:13,886 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:10:13,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:13,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash 288568115, now seen corresponding path program 1 times [2024-11-07 10:10:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:13,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377972824] [2024-11-07 10:10:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:10:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:10:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:10:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:10:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:10:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:10:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:10:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:10:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:10:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:10:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:10:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:10:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:10:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 10:10:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:10:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 10:10:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 10:10:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:10:14,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:14,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377972824] [2024-11-07 10:10:14,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377972824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:14,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:10:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293823085] [2024-11-07 10:10:14,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:14,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:10:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:10:14,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:10:14,299 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:14,347 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2024-11-07 10:10:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:10:14,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-07 10:10:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:14,350 INFO L225 Difference]: With dead ends: 217 [2024-11-07 10:10:14,350 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 10:10:14,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:10:14,351 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:14,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 10:10:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-07 10:10:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:10:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-07 10:10:14,378 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 152 [2024-11-07 10:10:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:14,379 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-07 10:10:14,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-07 10:10:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 10:10:14,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:14,382 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:10:14,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:14,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash 170126641, now seen corresponding path program 1 times [2024-11-07 10:10:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498184237] [2024-11-07 10:10:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:10:14,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:10:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:10:14,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:10:14,847 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:10:14,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:10:14,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:10:14,853 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 10:10:14,973 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:10:14,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:10:14 BoogieIcfgContainer [2024-11-07 10:10:14,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:10:14,978 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:10:14,979 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:10:14,979 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:10:14,980 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:13" (3/4) ... [2024-11-07 10:10:14,982 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:10:14,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:10:14,984 INFO L158 Benchmark]: Toolchain (without parser) took 3059.36ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 43.0MB in the end (delta: 34.2MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-11-07 10:10:14,984 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:14,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.22ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 61.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:10:14,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.54ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 58.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:14,985 INFO L158 Benchmark]: Boogie Preprocessor took 115.91ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 53.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:10:14,986 INFO L158 Benchmark]: RCFGBuilder took 732.21ms. Allocated memory is still 100.7MB. Free memory was 53.4MB in the beginning and 58.7MB in the end (delta: -5.4MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-07 10:10:14,987 INFO L158 Benchmark]: TraceAbstraction took 1809.74ms. Allocated memory is still 100.7MB. Free memory was 58.3MB in the beginning and 43.0MB in the end (delta: 15.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-07 10:10:14,987 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 100.7MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 14.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:14,988 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.25ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.22ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 61.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.54ms. Allocated memory is still 100.7MB. Free memory was 61.9MB in the beginning and 58.1MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 115.91ms. Allocated memory is still 100.7MB. Free memory was 58.1MB in the beginning and 53.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 732.21ms. Allocated memory is still 100.7MB. Free memory was 53.4MB in the beginning and 58.7MB in the end (delta: -5.4MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1809.74ms. Allocated memory is still 100.7MB. Free memory was 58.3MB in the beginning and 43.0MB in the end (delta: 15.3MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 100.7MB. Free memory was 43.0MB in the beginning and 43.0MB in the end (delta: 14.7kB). 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 102, overapproximation of someBinaryArithmeticDOUBLEoperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L76] EXPR float_Array_0[0] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L78] EXPR float_Array_0[1] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[2] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L80] EXPR float_Array_0[2] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] float_Array_0[3] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[3] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F [L82] EXPR float_Array_0[3] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L87] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L90] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 3221225470) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 3221225470) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L110] RET updateVariables() [L111] CALL step() [L40] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] COND TRUE BOOL_unsigned_char_Array_0[1] [L41] EXPR float_Array_0[3] [L41] EXPR float_Array_0[2] [L41] EXPR float_Array_0[1] [L41] float_Array_0[4] = ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]) [L45] EXPR float_Array_0[2] [L45] EXPR float_Array_0[3] [L45] EXPR double_Array_0[0] [L45] double_Array_0[1] = ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])) [L46] EXPR unsigned_long_int_Array_0[1][0] [L46] unsigned long int stepLocal_2 = unsigned_long_int_Array_0[1][0]; [L47] signed long int stepLocal_1 = 5; [L48] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L48] COND FALSE !(stepLocal_1 >= unsigned_long_int_Array_0[1][1]) [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[1]; [L60] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] COND TRUE BOOL_unsigned_char_Array_0[0] || stepLocal_0 [L61] EXPR unsigned_long_int_Array_0[1][1] [L61] EXPR unsigned_char_Array_0[1] [L61] EXPR unsigned_char_Array_0[1] [L61] unsigned_long_int_Array_0[0][1] = ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0]))) [L102] EXPR float_Array_0[4] [L102] EXPR float_Array_0[3] [L102] EXPR float_Array_0[2] [L102] EXPR float_Array_0[1] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) [L102] EXPR double_Array_0[1] [L102] EXPR float_Array_0[2] [L102] EXPR float_Array_0[3] [L102] EXPR double_Array_0[0] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR ((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR ((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102-L103] return (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 607 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 310 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 304 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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:10:15,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.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 abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:10:17,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:10:17,452 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:10:17,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:10:17,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:10:17,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:10:17,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:10:17,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:10:17,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:10:17,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:10:17,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:10:17,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:10:17,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:10:17,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:10:17,498 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:10:17,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:10:17,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:10:17,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:10:17,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:10:17,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:10:17,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:10:17,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:10:17,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:10:17,500 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:10:17,500 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:10:17,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:10:17,500 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:10:17,500 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:10:17,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:10:17,500 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:10:17,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:10:17,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:10:17,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:10:17,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:10:17,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:17,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:10:17,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:10:17,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:10:17,502 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:10:17,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:10:17,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:10:17,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:10:17,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:10:17,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:10:17,503 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 -> abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 [2024-11-07 10:10:17,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:10:17,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:10:17,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:10:17,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:10:17,810 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:10:17,812 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-20.i [2024-11-07 10:10:19,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:10:19,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:10:19,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2024-11-07 10:10:19,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b5dc4415/5170fb8ba7d9430cacfc9266e4bcdb15/FLAGcf256a2be [2024-11-07 10:10:19,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b5dc4415/5170fb8ba7d9430cacfc9266e4bcdb15 [2024-11-07 10:10:19,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:10:19,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:10:19,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:19,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:10:19,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:10:19,514 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:19" (1/1) ... [2024-11-07 10:10:19,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce4c3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:19, skipping insertion in model container [2024-11-07 10:10:19,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:19" (1/1) ... [2024-11-07 10:10:19,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:10:19,669 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-20.i[916,929] [2024-11-07 10:10:19,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:19,753 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:10:19,764 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-20.i[916,929] [2024-11-07 10:10:19,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:19,840 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:10:19,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:19 WrapperNode [2024-11-07 10:10:19,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:19,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:19,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:10:19,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:10:19,853 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:19" (1/1) ... [2024-11-07 10:10:19,877 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:19" (1/1) ... [2024-11-07 10:10:19,932 INFO L138 Inliner]: procedures = 36, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-11-07 10:10:19,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:19,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:10:19,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:10:19,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:10:19,946 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:19" (1/1) ... [2024-11-07 10:10:19,946 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:19" (1/1) ... [2024-11-07 10:10:19,958 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:19" (1/1) ... [2024-11-07 10:10:19,999 INFO L175 MemorySlicer]: Split 136 memory accesses to 6 slices as follows [2, 14, 13, 45, 33, 29]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 5, 3, 4]. The 20 writes are split as follows [0, 2, 2, 6, 5, 5]. [2024-11-07 10:10:20,000 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:19" (1/1) ... [2024-11-07 10:10:20,000 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:19" (1/1) ... [2024-11-07 10:10:20,041 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:19" (1/1) ... [2024-11-07 10:10:20,049 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:19" (1/1) ... [2024-11-07 10:10:20,057 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:19" (1/1) ... [2024-11-07 10:10:20,060 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:19" (1/1) ... [2024-11-07 10:10:20,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:10:20,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:10:20,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:10:20,077 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:10:20,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:19" (1/1) ... [2024-11-07 10:10:20,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:20,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:20,128 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:20,135 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:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:10:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:10:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:10:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-07 10:10:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-07 10:10:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-07 10:10:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-07 10:10:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:10:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:10:20,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-07 10:10:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-07 10:10:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-07 10:10:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-07 10:10:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:10:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:10:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:10:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:10:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:10:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:10:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:10:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:10:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:10:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:10:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:10:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:10:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:10:20,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:10:20,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:10:20,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:10:20,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 10:10:20,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-07 10:10:20,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:10:20,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:10:20,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:10:20,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 10:10:20,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-07 10:10:20,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:10:20,368 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:10:28,840 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-07 10:10:28,841 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:10:28,855 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:10:28,855 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:10:28,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:28 BoogieIcfgContainer [2024-11-07 10:10:28,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:10:28,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:10:28,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:10:28,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:10:28,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:19" (1/3) ... [2024-11-07 10:10:28,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622b43c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:28, skipping insertion in model container [2024-11-07 10:10:28,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:19" (2/3) ... [2024-11-07 10:10:28,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622b43c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:28, skipping insertion in model container [2024-11-07 10:10:28,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:28" (3/3) ... [2024-11-07 10:10:28,866 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-20.i [2024-11-07 10:10:28,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:10:28,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:10:28,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:10:28,939 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;@6aaedd4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:10:28,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:10:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:10:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 10:10:28,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:28,960 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1837224321, now seen corresponding path program 1 times [2024-11-07 10:10:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:10:28,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815491886] [2024-11-07 10:10:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:28,996 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:10:28,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:10:28,998 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:10:28,999 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:10:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:29,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:10:29,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:10:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-07 10:10:29,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:10:29,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:10:29,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815491886] [2024-11-07 10:10:29,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815491886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:29,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:29,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:10:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165039967] [2024-11-07 10:10:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:29,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:10:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:10:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:10:29,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:10:29,951 INFO L87 Difference]: Start difference. First operand has 113 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:29,979 INFO L93 Difference]: Finished difference Result 219 states and 347 transitions. [2024-11-07 10:10:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:10:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-07 10:10:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:29,989 INFO L225 Difference]: With dead ends: 219 [2024-11-07 10:10:29,990 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 10:10:29,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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:29,998 INFO L432 NwaCegarLoop]: 156 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, 156 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:29,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 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:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 10:10:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 10:10:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:10:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-07 10:10:30,048 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 152 [2024-11-07 10:10:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:30,049 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-07 10:10:30,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-07 10:10:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 10:10:30,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:30,056 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,095 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:10:30,258 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:10:30,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash 288568115, now seen corresponding path program 1 times [2024-11-07 10:10:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:10:30,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438533905] [2024-11-07 10:10:30,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:30,262 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:10:30,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:10:30,265 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:10:30,266 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:10:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:31,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:10:31,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:10:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-07 10:10:31,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:10:31,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:10:31,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438533905] [2024-11-07 10:10:31,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438533905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:31,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:10:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244983443] [2024-11-07 10:10:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:31,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:10:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:10:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:10:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:10:31,184 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:31,317 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2024-11-07 10:10:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:10:31,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-07 10:10:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:31,320 INFO L225 Difference]: With dead ends: 217 [2024-11-07 10:10:31,320 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 10:10:31,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 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:31,321 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:31,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:10:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 10:10:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-07 10:10:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:10:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-07 10:10:31,333 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 152 [2024-11-07 10:10:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:31,337 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-07 10:10:31,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-07 10:10:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 10:10:31,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:31,340 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,363 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:10:31,540 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:10:31,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:31,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash 170126641, now seen corresponding path program 1 times [2024-11-07 10:10:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:10:31,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39554476] [2024-11-07 10:10:31,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:31,542 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:10:31,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:10:31,545 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:10:31,547 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:10:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:32,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:10:32,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:10:32,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:10:32,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2024-11-07 10:10:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2024-11-07 10:10:33,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:10:33,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:10:33,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39554476] [2024-11-07 10:10:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39554476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:33,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:33,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:10:33,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947345857] [2024-11-07 10:10:33,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:33,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:10:33,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:10:33,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:10:33,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:10:33,020 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:37,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:10:42,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:10:45,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:10:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:45,678 INFO L93 Difference]: Finished difference Result 220 states and 314 transitions. [2024-11-07 10:10:45,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:10:45,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2024-11-07 10:10:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:45,684 INFO L225 Difference]: With dead ends: 220 [2024-11-07 10:10:45,684 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 10:10:45,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:10:45,686 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 136 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:45,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 452 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 1 Unknown, 0 Unchecked, 12.5s Time] [2024-11-07 10:10:45,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 10:10:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-07 10:10:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:10:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2024-11-07 10:10:45,695 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 152 [2024-11-07 10:10:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:45,697 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2024-11-07 10:10:45,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2024-11-07 10:10:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 10:10:45,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:45,699 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,730 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:10:45,899 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:10:45,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:45,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:45,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1730604853, now seen corresponding path program 1 times [2024-11-07 10:10:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:10:45,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212557158] [2024-11-07 10:10:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:45,901 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:10:45,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:10:45,903 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:10:45,904 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:10:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:46,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:10:46,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:10:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-07 10:10:46,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:10:46,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:10:46,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212557158] [2024-11-07 10:10:46,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212557158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:46,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:46,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:10:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083925161] [2024-11-07 10:10:46,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:46,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:10:46,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:10:46,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:10:46,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:10:46,839 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 10:10:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:47,445 INFO L93 Difference]: Finished difference Result 223 states and 316 transitions. [2024-11-07 10:10:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:10:47,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 154 [2024-11-07 10:10:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:47,447 INFO L225 Difference]: With dead ends: 223 [2024-11-07 10:10:47,447 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 10:10:47,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:10:47,449 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:47,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 615 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:10:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 10:10:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2024-11-07 10:10:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3111111111111111) internal successors, (118), 90 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:10:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-11-07 10:10:47,458 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 154 [2024-11-07 10:10:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:47,459 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-11-07 10:10:47,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 10:10:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-11-07 10:10:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 10:10:47,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:47,461 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 10:10:47,661 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:10:47,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:47,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:47,662 INFO L85 PathProgramCache]: Analyzing trace with hash -513953545, now seen corresponding path program 1 times [2024-11-07 10:10:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:10:47,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064962790] [2024-11-07 10:10:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:47,663 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:10:47,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:10:47,665 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:10:47,666 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:10:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:48,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:10:48,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:10:48,876 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:10:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-07 10:10:48,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:10:48,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:10:48,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064962790] [2024-11-07 10:10:48,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064962790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:48,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:48,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:10:48,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576801647] [2024-11-07 10:10:48,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:48,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:10:48,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:10:48,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:10:48,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:10:48,978 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:10:52,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:10:54,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:10:59,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:01,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:02,043 INFO L93 Difference]: Finished difference Result 219 states and 309 transitions. [2024-11-07 10:11:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:02,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2024-11-07 10:11:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:02,052 INFO L225 Difference]: With dead ends: 219 [2024-11-07 10:11:02,052 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 10:11:02,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:11:02,053 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 120 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:02,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 439 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 12.9s Time] [2024-11-07 10:11:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 10:11:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-07 10:11:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:11:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2024-11-07 10:11:02,075 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 154 [2024-11-07 10:11:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:02,075 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2024-11-07 10:11:02,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:11:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2024-11-07 10:11:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 10:11:02,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:02,077 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,117 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:02,281 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:02,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:02,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1853392193, now seen corresponding path program 1 times [2024-11-07 10:11:02,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:02,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55354598] [2024-11-07 10:11:02,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:02,283 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:02,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:02,285 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:02,286 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:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:03,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 10:11:03,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:03,791 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 94 treesize of output 40 [2024-11-07 10:11:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 24 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-07 10:11:04,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:04,673 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 58 treesize of output 22 [2024-11-07 10:11:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-07 10:11:04,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:04,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55354598] [2024-11-07 10:11:04,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55354598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:11:04,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:11:04,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-07 10:11:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540731806] [2024-11-07 10:11:04,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:11:04,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:11:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:04,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:11:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:11:04,779 INFO L87 Difference]: Start difference. First operand 109 states and 153 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-07 10:11:11,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:17,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:20,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:20,706 INFO L93 Difference]: Finished difference Result 228 states and 318 transitions. [2024-11-07 10:11:20,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:11:20,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 156 [2024-11-07 10:11:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:20,712 INFO L225 Difference]: With dead ends: 228 [2024-11-07 10:11:20,712 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 10:11:20,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:11:20,714 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 122 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:20,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 705 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 523 Invalid, 1 Unknown, 0 Unchecked, 15.3s Time] [2024-11-07 10:11:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 10:11:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-07 10:11:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:11:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2024-11-07 10:11:20,727 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 156 [2024-11-07 10:11:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:20,727 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2024-11-07 10:11:20,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-07 10:11:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2024-11-07 10:11:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 10:11:20,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:20,729 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,760 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:20,929 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:20,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:20,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 288468285, now seen corresponding path program 1 times [2024-11-07 10:11:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756434676] [2024-11-07 10:11:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:20,930 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:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:20,933 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:20,935 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:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:21,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:11:21,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:22,253 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:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-11-07 10:11:22,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:22,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:22,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756434676] [2024-11-07 10:11:22,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756434676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:22,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:22,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:22,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030004242] [2024-11-07 10:11:22,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:22,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:22,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:22,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:22,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:22,341 INFO L87 Difference]: Start difference. First operand 109 states and 151 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:11:26,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:28,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:31,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:31,987 INFO L93 Difference]: Finished difference Result 216 states and 300 transitions. [2024-11-07 10:11:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:31,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 156 [2024-11-07 10:11:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:31,994 INFO L225 Difference]: With dead ends: 216 [2024-11-07 10:11:31,994 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 10:11:31,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:11:31,995 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 109 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:31,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 429 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2024-11-07 10:11:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 10:11:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-07 10:11:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 88 states have internal predecessors, (112), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:11:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 150 transitions. [2024-11-07 10:11:32,003 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 150 transitions. Word has length 156 [2024-11-07 10:11:32,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:32,004 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 150 transitions. [2024-11-07 10:11:32,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:11:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2024-11-07 10:11:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 10:11:32,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:32,007 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 10:11:32,207 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:32,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:32,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash 201696567, now seen corresponding path program 1 times [2024-11-07 10:11:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:32,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355921631] [2024-11-07 10:11:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:32,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:32,210 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:32,211 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:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:33,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:11:33,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:33,596 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 97 treesize of output 43 [2024-11-07 10:11:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-07 10:11:33,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:33,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:33,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355921631] [2024-11-07 10:11:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355921631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:33,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675044942] [2024-11-07 10:11:33,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:33,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:33,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:33,673 INFO L87 Difference]: Start difference. First operand 109 states and 150 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:11:38,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:43,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:43,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:43,957 INFO L93 Difference]: Finished difference Result 216 states and 298 transitions. [2024-11-07 10:11:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:43,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2024-11-07 10:11:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:43,963 INFO L225 Difference]: With dead ends: 216 [2024-11-07 10:11:43,963 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 10:11:43,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:11:43,964 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 100 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:43,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 423 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 1 Unknown, 0 Unchecked, 10.2s Time] [2024-11-07 10:11:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 10:11:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-07 10:11:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:11:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 149 transitions. [2024-11-07 10:11:43,974 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 149 transitions. Word has length 158 [2024-11-07 10:11:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:43,974 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 149 transitions. [2024-11-07 10:11:43,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:11:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 149 transitions. [2024-11-07 10:11:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 10:11:43,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:43,976 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,010 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:44,176 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:44,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:44,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1076214915, now seen corresponding path program 1 times [2024-11-07 10:11:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:44,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289160327] [2024-11-07 10:11:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:44,178 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:44,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:44,180 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:44,181 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