./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.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-21.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', 'a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e'] 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-21.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 a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:10:17,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:10:17,764 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:17,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:10:17,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:10:17,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:10:17,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:10:17,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:10:17,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:10:17,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:10:17,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:10:17,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:10:17,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:10:17,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:10:17,807 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:10:17,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:10:17,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:10:17,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:10:17,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:10:17,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:10:17,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:10:17,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:10:17,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:10:17,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:10:17,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:10:17,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:10:17,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:10:17,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:10:17,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:10:17,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:10:17,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:10:17,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:10:17,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:17,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:10:17,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:10:17,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:10:17,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:10:17,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:10:17,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:10:17,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:10:17,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:10:17,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:10:17,813 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 -> a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e [2024-11-07 10:10:18,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:10:18,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:10:18,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:10:18,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:10:18,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:10:18,142 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-21.i [2024-11-07 10:10:19,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:10:19,848 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:10:19,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2024-11-07 10:10:19,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d368e9faf/484021d82ce245f1985e80f8d767f71b/FLAG6f07f91d2 [2024-11-07 10:10:19,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d368e9faf/484021d82ce245f1985e80f8d767f71b [2024-11-07 10:10:19,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:10:19,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:10:19,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:19,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:10:19,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:10:19,900 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,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6d2c28 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,903 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,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:10:20,065 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-21.i[916,929] [2024-11-07 10:10:20,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:20,168 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:10:20,178 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-21.i[916,929] [2024-11-07 10:10:20,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:20,251 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:10:20,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:20 WrapperNode [2024-11-07 10:10:20,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:20,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:20,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:10:20,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:10:20,260 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:20" (1/1) ... [2024-11-07 10:10:20,276 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:20" (1/1) ... [2024-11-07 10:10:20,326 INFO L138 Inliner]: procedures = 29, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-11-07 10:10:20,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:20,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:10:20,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:10:20,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:10:20,348 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:20" (1/1) ... [2024-11-07 10:10:20,348 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:20" (1/1) ... [2024-11-07 10:10:20,355 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:20" (1/1) ... [2024-11-07 10:10:20,381 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2024-11-07 10:10:20,382 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:20" (1/1) ... [2024-11-07 10:10:20,382 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:20" (1/1) ... [2024-11-07 10:10:20,408 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:20" (1/1) ... [2024-11-07 10:10:20,417 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:20" (1/1) ... [2024-11-07 10:10:20,420 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:20" (1/1) ... [2024-11-07 10:10:20,426 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:20" (1/1) ... [2024-11-07 10:10:20,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:10:20,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:10:20,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:10:20,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:10:20,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:20" (1/1) ... [2024-11-07 10:10:20,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:20,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:20,486 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,490 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,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:10:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:10:20,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:10:20,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:10:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:10:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:10:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:10:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:10:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:10:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:10:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:10:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:10:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:10:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:10:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:10:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:10:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:10:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:10:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:10:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:10:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:10:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:10:20,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:10:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:10:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:10:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:10:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:10:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:10:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:10:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:10:20,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:10:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:10:20,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:10:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:10:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:10:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:10:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:10:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:10:20,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:10:20,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:10:20,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:10:20,695 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:10:20,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:10:21,164 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-07 10:10:21,164 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:10:21,178 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:10:21,178 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:10:21,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:21 BoogieIcfgContainer [2024-11-07 10:10:21,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:10:21,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:10:21,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:10:21,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:10:21,187 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:21,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb0fdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:21, skipping insertion in model container [2024-11-07 10:10:21,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:20" (2/3) ... [2024-11-07 10:10:21,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb0fdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:21, skipping insertion in model container [2024-11-07 10:10:21,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:21" (3/3) ... [2024-11-07 10:10:21,190 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-21.i [2024-11-07 10:10:21,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:10:21,206 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:10:21,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:10:21,284 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;@372377b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:10:21,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:10:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:10:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:10:21,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:21,301 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:21,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:21,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1393676978, now seen corresponding path program 1 times [2024-11-07 10:10:21,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:21,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528138056] [2024-11-07 10:10:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:21,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:21,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:21,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:21,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:21,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528138056] [2024-11-07 10:10:21,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528138056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:21,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:21,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:10:21,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477900228] [2024-11-07 10:10:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:21,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:10:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:10:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:10:21,665 INFO L87 Difference]: Start difference. First operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:21,694 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-07 10:10:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:10:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-07 10:10:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:21,705 INFO L225 Difference]: With dead ends: 185 [2024-11-07 10:10:21,705 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:10:21,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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:21,712 INFO L432 NwaCegarLoop]: 135 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, 135 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:21,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 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:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:10:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 10:10:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:10:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-11-07 10:10:21,763 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2024-11-07 10:10:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:21,765 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-11-07 10:10:21,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-11-07 10:10:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:10:21,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:21,771 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:10:21,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:21,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -259048304, now seen corresponding path program 1 times [2024-11-07 10:10:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:21,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915742829] [2024-11-07 10:10:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915742829] [2024-11-07 10:10:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915742829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:22,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:22,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:10:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615958972] [2024-11-07 10:10:22,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:22,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:10:22,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:22,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:10:22,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:10:22,137 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:22,181 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2024-11-07 10:10:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:10:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-07 10:10:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:22,186 INFO L225 Difference]: With dead ends: 183 [2024-11-07 10:10:22,187 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 10:10:22,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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:22,188 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 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:22,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 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:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 10:10:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-07 10:10:22,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:10:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-07 10:10:22,207 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 80 [2024-11-07 10:10:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:22,209 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-07 10:10:22,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-07 10:10:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:10:22,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:22,210 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:10:22,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:22,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash 158348302, now seen corresponding path program 1 times [2024-11-07 10:10:22,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:22,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681193841] [2024-11-07 10:10:22,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:22,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:22,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:22,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681193841] [2024-11-07 10:10:22,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681193841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:22,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:22,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:10:22,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879090707] [2024-11-07 10:10:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:22,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:10:22,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:22,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:10:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:10:22,942 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:23,164 INFO L93 Difference]: Finished difference Result 307 states and 449 transitions. [2024-11-07 10:10:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:10:23,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2024-11-07 10:10:23,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:23,167 INFO L225 Difference]: With dead ends: 307 [2024-11-07 10:10:23,168 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 10:10:23,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:10:23,169 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 239 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:23,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 704 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:10:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 10:10:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2024-11-07 10:10:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.430232558139535) internal successors, (246), 172 states have internal predecessors, (246), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:10:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2024-11-07 10:10:23,194 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 80 [2024-11-07 10:10:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:23,194 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2024-11-07 10:10:23,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2024-11-07 10:10:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 10:10:23,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:23,198 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:10:23,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1038830393, now seen corresponding path program 1 times [2024-11-07 10:10:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:23,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976667500] [2024-11-07 10:10:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:23,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:23,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:23,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:23,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:23,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:23,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:23,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:23,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976667500] [2024-11-07 10:10:23,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976667500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:23,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:23,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:10:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138734378] [2024-11-07 10:10:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:23,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:10:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:23,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:10:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:10:23,359 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:23,408 INFO L93 Difference]: Finished difference Result 378 states and 549 transitions. [2024-11-07 10:10:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:10:23,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-11-07 10:10:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:23,410 INFO L225 Difference]: With dead ends: 378 [2024-11-07 10:10:23,413 INFO L226 Difference]: Without dead ends: 192 [2024-11-07 10:10:23,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:10:23,415 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:23,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:23,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-07 10:10:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-07 10:10:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.417142857142857) internal successors, (248), 175 states have internal predecessors, (248), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:10:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 276 transitions. [2024-11-07 10:10:23,440 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 276 transitions. Word has length 83 [2024-11-07 10:10:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:23,444 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 276 transitions. [2024-11-07 10:10:23,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 276 transitions. [2024-11-07 10:10:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 10:10:23,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:23,445 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:10:23,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:23,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash -564200222, now seen corresponding path program 1 times [2024-11-07 10:10:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:23,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790036975] [2024-11-07 10:10:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:24,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:24,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:24,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:24,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:24,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:24,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:24,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:24,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790036975] [2024-11-07 10:10:24,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790036975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:24,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:24,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:10:24,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150494689] [2024-11-07 10:10:24,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:24,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:10:24,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:10:24,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:10:24,444 INFO L87 Difference]: Start difference. First operand 192 states and 276 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:24,663 INFO L93 Difference]: Finished difference Result 490 states and 697 transitions. [2024-11-07 10:10:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:10:24,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2024-11-07 10:10:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:24,668 INFO L225 Difference]: With dead ends: 490 [2024-11-07 10:10:24,670 INFO L226 Difference]: Without dead ends: 301 [2024-11-07 10:10:24,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:10:24,671 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 131 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:24,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 913 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:10:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-07 10:10:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 227. [2024-11-07 10:10:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 210 states have (on average 1.4047619047619047) internal successors, (295), 210 states have internal predecessors, (295), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:10:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 323 transitions. [2024-11-07 10:10:24,688 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 323 transitions. Word has length 87 [2024-11-07 10:10:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:24,689 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 323 transitions. [2024-11-07 10:10:24,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 323 transitions. [2024-11-07 10:10:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 10:10:24,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:24,693 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:10:24,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:24,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:24,694 INFO L85 PathProgramCache]: Analyzing trace with hash -205138822, now seen corresponding path program 1 times [2024-11-07 10:10:24,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:24,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595652255] [2024-11-07 10:10:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:25,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:25,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595652255] [2024-11-07 10:10:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595652255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:25,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:25,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:10:25,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248674070] [2024-11-07 10:10:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:25,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:10:25,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:25,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:10:25,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:10:25,420 INFO L87 Difference]: Start difference. First operand 227 states and 323 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:25,595 INFO L93 Difference]: Finished difference Result 431 states and 608 transitions. [2024-11-07 10:10:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:10:25,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2024-11-07 10:10:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:25,598 INFO L225 Difference]: With dead ends: 431 [2024-11-07 10:10:25,598 INFO L226 Difference]: Without dead ends: 314 [2024-11-07 10:10:25,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:10:25,599 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 37 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:25,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 748 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:10:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-07 10:10:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 230. [2024-11-07 10:10:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 213 states have (on average 1.3990610328638498) internal successors, (298), 213 states have internal predecessors, (298), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:10:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 326 transitions. [2024-11-07 10:10:25,626 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 326 transitions. Word has length 88 [2024-11-07 10:10:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:25,627 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 326 transitions. [2024-11-07 10:10:25,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 326 transitions. [2024-11-07 10:10:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:10:25,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:25,630 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:10:25,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:25,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:25,631 INFO L85 PathProgramCache]: Analyzing trace with hash -145742675, now seen corresponding path program 1 times [2024-11-07 10:10:25,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:25,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356002657] [2024-11-07 10:10:25,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:25,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:25,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:25,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356002657] [2024-11-07 10:10:25,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356002657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:25,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:25,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:10:25,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473117755] [2024-11-07 10:10:25,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:25,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:10:25,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:25,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:10:25,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:10:25,910 INFO L87 Difference]: Start difference. First operand 230 states and 326 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:25,967 INFO L93 Difference]: Finished difference Result 240 states and 337 transitions. [2024-11-07 10:10:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:10:25,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2024-11-07 10:10:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:25,970 INFO L225 Difference]: With dead ends: 240 [2024-11-07 10:10:25,970 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 10:10:25,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:10:25,971 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:25,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 10:10:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-07 10:10:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 221 states have (on average 1.3846153846153846) internal successors, (306), 221 states have internal predecessors, (306), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:10:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 334 transitions. [2024-11-07 10:10:25,980 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 334 transitions. Word has length 89 [2024-11-07 10:10:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:25,981 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 334 transitions. [2024-11-07 10:10:25,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 334 transitions. [2024-11-07 10:10:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:10:25,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:25,982 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:10:25,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:25,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash -217896198, now seen corresponding path program 1 times [2024-11-07 10:10:25,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:25,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165218346] [2024-11-07 10:10:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:25,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:26,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:26,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:26,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165218346] [2024-11-07 10:10:26,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165218346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:26,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:26,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:10:26,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385509] [2024-11-07 10:10:26,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:26,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:10:26,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:10:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:10:26,720 INFO L87 Difference]: Start difference. First operand 238 states and 334 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:27,030 INFO L93 Difference]: Finished difference Result 800 states and 1117 transitions. [2024-11-07 10:10:27,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:10:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-11-07 10:10:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:27,034 INFO L225 Difference]: With dead ends: 800 [2024-11-07 10:10:27,034 INFO L226 Difference]: Without dead ends: 565 [2024-11-07 10:10:27,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:10:27,036 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 336 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:27,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1062 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:10:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-07 10:10:27,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 459. [2024-11-07 10:10:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 426 states have (on average 1.3943661971830985) internal successors, (594), 426 states have internal predecessors, (594), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:10:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 650 transitions. [2024-11-07 10:10:27,067 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 650 transitions. Word has length 89 [2024-11-07 10:10:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:27,067 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 650 transitions. [2024-11-07 10:10:27,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 650 transitions. [2024-11-07 10:10:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:10:27,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:27,069 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:10:27,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:27,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash -353095500, now seen corresponding path program 1 times [2024-11-07 10:10:27,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:27,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535606532] [2024-11-07 10:10:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:27,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:27,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535606532] [2024-11-07 10:10:27,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535606532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:27,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:27,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:10:27,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502401707] [2024-11-07 10:10:27,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:27,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:10:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:27,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:10:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:10:27,272 INFO L87 Difference]: Start difference. First operand 459 states and 650 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:27,437 INFO L93 Difference]: Finished difference Result 1087 states and 1520 transitions. [2024-11-07 10:10:27,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:10:27,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-11-07 10:10:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:27,442 INFO L225 Difference]: With dead ends: 1087 [2024-11-07 10:10:27,442 INFO L226 Difference]: Without dead ends: 631 [2024-11-07 10:10:27,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:10:27,443 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 227 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:27,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 635 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:10:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-07 10:10:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 533. [2024-11-07 10:10:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 500 states have (on average 1.38) internal successors, (690), 500 states have internal predecessors, (690), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:10:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 746 transitions. [2024-11-07 10:10:27,478 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 746 transitions. Word has length 90 [2024-11-07 10:10:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:27,478 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 746 transitions. [2024-11-07 10:10:27,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 746 transitions. [2024-11-07 10:10:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:10:27,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:27,483 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:10:27,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:27,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash -66064140, now seen corresponding path program 1 times [2024-11-07 10:10:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481165177] [2024-11-07 10:10:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:27,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:27,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481165177] [2024-11-07 10:10:27,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481165177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:27,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:27,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:10:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174360080] [2024-11-07 10:10:27,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:27,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:10:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:10:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:10:27,680 INFO L87 Difference]: Start difference. First operand 533 states and 746 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:27,762 INFO L93 Difference]: Finished difference Result 1079 states and 1509 transitions. [2024-11-07 10:10:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:10:27,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-11-07 10:10:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:27,767 INFO L225 Difference]: With dead ends: 1079 [2024-11-07 10:10:27,767 INFO L226 Difference]: Without dead ends: 549 [2024-11-07 10:10:27,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:10:27,772 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:27,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:10:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-07 10:10:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 537. [2024-11-07 10:10:27,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 504 states have (on average 1.376984126984127) internal successors, (694), 504 states have internal predecessors, (694), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:10:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 750 transitions. [2024-11-07 10:10:27,809 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 750 transitions. Word has length 90 [2024-11-07 10:10:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:27,809 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 750 transitions. [2024-11-07 10:10:27,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 750 transitions. [2024-11-07 10:10:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:10:27,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:27,811 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:10:27,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:27,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1463893872, now seen corresponding path program 1 times [2024-11-07 10:10:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874885134] [2024-11-07 10:10:27,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:27,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:10:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:10:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:10:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:10:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:10:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:10:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:10:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:10:27,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874885134] [2024-11-07 10:10:27,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874885134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:27,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:27,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:10:27,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901826302] [2024-11-07 10:10:27,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:27,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:10:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:10:27,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:10:27,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:10:27,901 INFO L87 Difference]: Start difference. First operand 537 states and 750 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:27,928 INFO L93 Difference]: Finished difference Result 1079 states and 1513 transitions. [2024-11-07 10:10:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:10:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-11-07 10:10:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:27,933 INFO L225 Difference]: With dead ends: 1079 [2024-11-07 10:10:27,935 INFO L226 Difference]: Without dead ends: 545 [2024-11-07 10:10:27,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:10:27,937 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:10:27,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:10:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-07 10:10:27,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 544. [2024-11-07 10:10:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 511 states have (on average 1.3718199608610568) internal successors, (701), 511 states have internal predecessors, (701), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 10:10:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 757 transitions. [2024-11-07 10:10:27,966 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 757 transitions. Word has length 90 [2024-11-07 10:10:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:27,966 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 757 transitions. [2024-11-07 10:10:27,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 757 transitions. [2024-11-07 10:10:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:10:27,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:27,968 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:10:27,969 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:27,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1242725522, now seen corresponding path program 1 times [2024-11-07 10:10:27,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:10:27,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181982242] [2024-11-07 10:10:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:27,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:10:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:10:28,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707506435] [2024-11-07 10:10:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:28,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:10:28,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:28,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:10:28,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:10:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:10:28,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:10:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:10:28,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:10:28,447 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:10:28,448 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:10:28,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:10:28,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 10:10:28,653 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:10:28,753 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:10:28,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:10:28 BoogieIcfgContainer [2024-11-07 10:10:28,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:10:28,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:10:28,756 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:10:28,757 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:10:28,758 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:21" (3/4) ... [2024-11-07 10:10:28,760 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:10:28,761 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:10:28,763 INFO L158 Benchmark]: Toolchain (without parser) took 8871.28ms. Allocated memory was 100.7MB in the beginning and 209.7MB in the end (delta: 109.1MB). Free memory was 76.7MB in the beginning and 164.4MB in the end (delta: -87.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-07 10:10:28,764 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:28,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.88ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 62.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:10:28,764 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.65ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 59.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:28,765 INFO L158 Benchmark]: Boogie Preprocessor took 107.20ms. Allocated memory is still 100.7MB. Free memory was 59.5MB in the beginning and 55.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:28,765 INFO L158 Benchmark]: RCFGBuilder took 739.10ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 64.7MB in the end (delta: -9.4MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-07 10:10:28,765 INFO L158 Benchmark]: TraceAbstraction took 7573.67ms. Allocated memory was 100.7MB in the beginning and 209.7MB in the end (delta: 109.1MB). Free memory was 64.3MB in the beginning and 164.4MB in the end (delta: -100.1MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. [2024-11-07 10:10:28,766 INFO L158 Benchmark]: Witness Printer took 4.74ms. Allocated memory is still 209.7MB. Free memory was 164.4MB in the beginning and 164.4MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:10:28,767 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.88ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 62.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.65ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 59.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 107.20ms. Allocated memory is still 100.7MB. Free memory was 59.5MB in the beginning and 55.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 739.10ms. Allocated memory is still 100.7MB. Free memory was 55.4MB in the beginning and 64.7MB in the end (delta: -9.4MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7573.67ms. Allocated memory was 100.7MB in the beginning and 209.7MB in the end (delta: 109.1MB). Free memory was 64.3MB in the beginning and 164.4MB in the end (delta: -100.1MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. * Witness Printer took 4.74ms. Allocated memory is still 209.7MB. Free memory was 164.4MB in the beginning and 164.4MB in the end (delta: 34.3kB). 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 someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L25-L27] double double_Array_0[3] = { 15.4, 15.6, 32.2 }; [L28-L30] float float_Array_0[2] = { 5.75, 8.6 }; [L28-L30] float float_Array_0[2] = { 5.75, 8.6 }; [L28-L30] float float_Array_0[2] = { 5.75, 8.6 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 256 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L37] unsigned char last_1_BOOL_unsigned_char_Array_0_1_ = 0; [L38] signed short int last_1_signed_short_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L82] EXPR BOOL_unsigned_char_Array_0[1] [L82] last_1_BOOL_unsigned_char_Array_0_1_ = BOOL_unsigned_char_Array_0[1] [L83] EXPR signed_short_int_Array_0[0] [L83] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L93] RET updateLastVariables() [L94] 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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] double_Array_0[0] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[0] [L71] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && 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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L71] EXPR double_Array_0[0] [L71] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && 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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] double_Array_0[1] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[1] [L73] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L73] EXPR double_Array_0[1] [L73] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] double_Array_0[2] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[2] [L75] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F [L75] EXPR double_Array_0[2] [L75] EXPR double_Array_0[2] >= -922337.2036854776000e+13F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854776000e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] float_Array_0[0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L77] EXPR float_Array_0[0] [L77] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] float_Array_0[1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[1] [L79] 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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L79] EXPR float_Array_0[1] [L79] 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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] RET updateVariables() [L95] CALL step() [L42] COND TRUE (last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND FALSE !(last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND TRUE BOOL_unsigned_char_Array_0[0] [L52] EXPR float_Array_0[0] [L52] EXPR float_Array_0[1] [L52] EXPR double_Array_0[1] [L52] EXPR double_Array_0[2] [L52] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] COND FALSE !((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) [L55] EXPR unsigned_short_int_Array_0[0] [L55] signed_short_int_Array_0[0] = unsigned_short_int_Array_0[0] [L58] EXPR double_Array_0[1] [L58] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) [L58] EXPR double_Array_0[1] [L58] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] COND TRUE ((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2] [L59] last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L59] last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L59] COND FALSE !(last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR ((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1 [L86] EXPR (last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) [L86] EXPR double_Array_0[1] [L86] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) [L86] EXPR double_Array_0[1] [L86] EXPR ((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) [L86] EXPR BOOL_unsigned_char_Array_0[1] [L86] EXPR BOOL_unsigned_char_Array_0[0] [L86] EXPR (((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR (((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((unsigned_short_int_Array_0[0]) > (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((unsigned_short_int_Array_0[0]) > (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86-L87] return ((((last_1_signed_short_int_Array_0_0_ + ((((last_1_signed_short_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ < (last_1_signed_short_int_Array_0_0_ - last_1_signed_short_int_Array_0_0_)) ? ((last_1_signed_short_int_Array_0_0_ != (((((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) < 0 ) ? -((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))) : ((((last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_short_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_)))))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : 1) : 1) : (unsigned_short_int_Array_0[0] == ((unsigned short int) last_1_signed_short_int_Array_0_0_))) && ((((((double_Array_0[1]) < (double_Array_0[0])) ? (double_Array_0[1]) : (double_Array_0[0]))) <= double_Array_0[2]) ? ((last_1_BOOL_unsigned_char_Array_0_1_ && (unsigned_short_int_Array_0[0] >= unsigned_short_int_Array_0[0])) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) 0)) : 1) : (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (((float_Array_0[0] - float_Array_0[1]) >= ((double_Array_0[1] + double_Array_0[2]) + double_Array_0[0])) ? (signed_short_int_Array_0[0] == ((signed short int) ((((unsigned_short_int_Array_0[0]) > (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))))) : (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[0]))) : 1) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_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, last_1_BOOL_unsigned_char_Array_0_1_=0, last_1_signed_short_int_Array_0_0_=256, signed_short_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 970 mSDsluCounter, 7133 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5595 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 722 IncrementalHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 1538 mSDtfsCounter, 722 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=11, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 402 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1126 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 935 ConstructedInterpolants, 0 QuantifiedInterpolants, 2881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 924/924 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:28,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.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 a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:10:31,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:10:31,269 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:31,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:10:31,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:10:31,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:10:31,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:10:31,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:10:31,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:10:31,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:10:31,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:10:31,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:10:31,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:10:31,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:10:31,315 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:10:31,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:10:31,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:10:31,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:10:31,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:10:31,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:10:31,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:10:31,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:10:31,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:10:31,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:10:31,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:10:31,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:10:31,318 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:10:31,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:10:31,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:10:31,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:10:31,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:10:31,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:10:31,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:10:31,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:10:31,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:31,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:10:31,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:10:31,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:10:31,319 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:10:31,319 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:10:31,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:10:31,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:10:31,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:10:31,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:10:31,320 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 -> a613ff2a3df0465e812c3a4c7d1f8dd29bfe76a3da6f0fcdf62ac29017602d5e [2024-11-07 10:10:31,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:10:31,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:10:31,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:10:31,672 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:10:31,673 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:10:31,674 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-21.i [2024-11-07 10:10:33,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:10:33,302 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:10:33,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2024-11-07 10:10:33,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbb42851c/edf38af5cef547c38bbb0c7cc398db3e/FLAG009b8f521 [2024-11-07 10:10:33,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbb42851c/edf38af5cef547c38bbb0c7cc398db3e [2024-11-07 10:10:33,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:10:33,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:10:33,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:33,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:10:33,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:10:33,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:33" (1/1) ... [2024-11-07 10:10:33,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cea261f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:33, skipping insertion in model container [2024-11-07 10:10:33,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:10:33" (1/1) ... [2024-11-07 10:10:33,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:10:33,501 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-21.i[916,929] [2024-11-07 10:10:33,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:33,585 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:10:33,598 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-21.i[916,929] [2024-11-07 10:10:33,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:10:33,677 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:10:33,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:33 WrapperNode [2024-11-07 10:10:33,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:10:33,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:33,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:10:33,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:10:33,689 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:33" (1/1) ... [2024-11-07 10:10:33,711 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:33" (1/1) ... [2024-11-07 10:10:33,765 INFO L138 Inliner]: procedures = 36, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2024-11-07 10:10:33,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:10:33,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:10:33,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:10:33,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:10:33,777 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:33" (1/1) ... [2024-11-07 10:10:33,778 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:33" (1/1) ... [2024-11-07 10:10:33,790 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:33" (1/1) ... [2024-11-07 10:10:33,827 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2024-11-07 10:10:33,828 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:33" (1/1) ... [2024-11-07 10:10:33,828 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:33" (1/1) ... [2024-11-07 10:10:33,869 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:33" (1/1) ... [2024-11-07 10:10:33,874 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:33" (1/1) ... [2024-11-07 10:10:33,883 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:33" (1/1) ... [2024-11-07 10:10:33,886 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:33" (1/1) ... [2024-11-07 10:10:33,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:10:33,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:10:33,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:10:33,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:10:33,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:33" (1/1) ... [2024-11-07 10:10:33,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:10:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:10:33,941 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:33,945 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:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:10:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:10:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:10:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-07 10:10:33,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:10:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:10:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:10:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:10:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-07 10:10:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-07 10:10:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:10:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:10:33,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:10:33,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:10:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:10:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:10:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:10:33,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-07 10:10:34,155 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:10:34,157 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:10:46,457 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-07 10:10:46,458 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:10:46,469 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:10:46,469 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:10:46,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:46 BoogieIcfgContainer [2024-11-07 10:10:46,469 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:10:46,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:10:46,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:10:46,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:10:46,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:10:33" (1/3) ... [2024-11-07 10:10:46,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e34588d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:46, skipping insertion in model container [2024-11-07 10:10:46,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:10:33" (2/3) ... [2024-11-07 10:10:46,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e34588d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:10:46, skipping insertion in model container [2024-11-07 10:10:46,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:10:46" (3/3) ... [2024-11-07 10:10:46,480 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-21.i [2024-11-07 10:10:46,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:10:46,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:10:46,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:10:46,571 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;@21b3374f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:10:46,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:10:46,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:10:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:10:46,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:46,587 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:46,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:46,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1393676978, now seen corresponding path program 1 times [2024-11-07 10:10:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:10:46,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409372818] [2024-11-07 10:10:46,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:46,611 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:46,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:10:46,614 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:46,617 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:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:10:47,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:10:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 10:10:47,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:10:47,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:10:47,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409372818] [2024-11-07 10:10:47,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409372818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:47,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:47,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:10:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329866149] [2024-11-07 10:10:47,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:47,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:10:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:10:47,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:10:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:10:47,105 INFO L87 Difference]: Start difference. First operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:47,131 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-07 10:10:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:10:47,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-07 10:10:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:47,139 INFO L225 Difference]: With dead ends: 185 [2024-11-07 10:10:47,139 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:10:47,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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:47,145 INFO L432 NwaCegarLoop]: 135 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, 135 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:47,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 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:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:10:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 10:10:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:10:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-11-07 10:10:47,181 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2024-11-07 10:10:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:47,181 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-11-07 10:10:47,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-11-07 10:10:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:10:47,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:47,189 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:10:47,392 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:47,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:47,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:47,394 INFO L85 PathProgramCache]: Analyzing trace with hash -259048304, now seen corresponding path program 1 times [2024-11-07 10:10:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:10:47,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417750133] [2024-11-07 10:10:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:47,395 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,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:10:47,398 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:47,399 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:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:47,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:10:47,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:10:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-07 10:10:47,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:10:47,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:10:47,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417750133] [2024-11-07 10:10:47,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417750133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:47,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:47,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:10:47,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241863922] [2024-11-07 10:10:47,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:47,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:10:47,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:10:47,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:10:47,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:10:47,794 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:10:47,918 INFO L93 Difference]: Finished difference Result 183 states and 270 transitions. [2024-11-07 10:10:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:10:47,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-07 10:10:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:10:47,923 INFO L225 Difference]: With dead ends: 183 [2024-11-07 10:10:47,923 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 10:10:47,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 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:47,925 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 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:47,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 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:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 10:10:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-07 10:10:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:10:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2024-11-07 10:10:47,939 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 80 [2024-11-07 10:10:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:10:47,940 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2024-11-07 10:10:47,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:10:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2024-11-07 10:10:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:10:47,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:10:47,943 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,952 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:48,143 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:48,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:10:48,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:10:48,144 INFO L85 PathProgramCache]: Analyzing trace with hash 158348302, now seen corresponding path program 1 times [2024-11-07 10:10:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:10:48,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388316279] [2024-11-07 10:10:48,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:10:48,145 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:48,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:10:48,147 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:48,148 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:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:10:48,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:10:48,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:10:48,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:10:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:10:49,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:10:49,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:10:49,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388316279] [2024-11-07 10:10:49,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388316279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:10:49,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:10:49,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:10:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312244539] [2024-11-07 10:10:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:10:49,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:10:49,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:10:49,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:10:49,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:10:49,124 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:10:53,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:10:55,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:10:57,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:00,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:02,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:05,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:05,626 INFO L93 Difference]: Finished difference Result 307 states and 449 transitions. [2024-11-07 10:11:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:11:05,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2024-11-07 10:11:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:05,630 INFO L225 Difference]: With dead ends: 307 [2024-11-07 10:11:05,630 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 10:11:05,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:11:05,634 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 236 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:05,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 370 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 16.4s Time] [2024-11-07 10:11:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 10:11:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 189. [2024-11-07 10:11:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 172 states have (on average 1.430232558139535) internal successors, (246), 172 states have internal predecessors, (246), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:11:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2024-11-07 10:11:05,679 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 80 [2024-11-07 10:11:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:05,680 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2024-11-07 10:11:05,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:11:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2024-11-07 10:11:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 10:11:05,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:05,682 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:11:05,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:05,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:05,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1038830393, now seen corresponding path program 1 times [2024-11-07 10:11:05,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:05,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126055551] [2024-11-07 10:11:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:05,891 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:05,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:05,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:11:05,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 10:11:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:06,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 10:11:06,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:07,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:11:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 10:11:07,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-07 10:11:08,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:08,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126055551] [2024-11-07 10:11:08,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126055551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:11:08,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:11:08,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-11-07 10:11:08,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962581359] [2024-11-07 10:11:08,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:11:08,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:11:08,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:08,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:11:08,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-07 10:11:08,364 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand has 16 states, 12 states have (on average 7.583333333333333) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-07 10:11:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:09,262 INFO L93 Difference]: Finished difference Result 360 states and 512 transitions. [2024-11-07 10:11:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:11:09,263 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 7.583333333333333) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) Word has length 83 [2024-11-07 10:11:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:09,265 INFO L225 Difference]: With dead ends: 360 [2024-11-07 10:11:09,265 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 10:11:09,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:11:09,270 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 176 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:09,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 788 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:11:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 10:11:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-07 10:11:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 153 states have (on average 1.3790849673202614) internal successors, (211), 153 states have internal predecessors, (211), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:11:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 239 transitions. [2024-11-07 10:11:09,288 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 239 transitions. Word has length 83 [2024-11-07 10:11:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:09,289 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 239 transitions. [2024-11-07 10:11:09,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 7.583333333333333) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-07 10:11:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 239 transitions. [2024-11-07 10:11:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 10:11:09,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:09,292 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:09,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 10:11:09,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:09,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:09,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1596084527, now seen corresponding path program 1 times [2024-11-07 10:11:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:09,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598312414] [2024-11-07 10:11:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:09,498 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:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:09,500 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:11:09,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 10:11:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:09,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:11:09,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:11:09,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:09,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:09,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598312414] [2024-11-07 10:11:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598312414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374017565] [2024-11-07 10:11:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:09,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:11:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:11:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:11:09,924 INFO L87 Difference]: Start difference. First operand 174 states and 239 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:11:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:10,017 INFO L93 Difference]: Finished difference Result 276 states and 382 transitions. [2024-11-07 10:11:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:11:10,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-11-07 10:11:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:10,019 INFO L225 Difference]: With dead ends: 276 [2024-11-07 10:11:10,019 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 10:11:10,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:11:10,020 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:10,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:11:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 10:11:10,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-07 10:11:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.3717948717948718) internal successors, (214), 156 states have internal predecessors, (214), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:11:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2024-11-07 10:11:10,033 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 84 [2024-11-07 10:11:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:10,033 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2024-11-07 10:11:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:11:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2024-11-07 10:11:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 10:11:10,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:10,037 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:11:10,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 10:11:10,237 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:10,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:10,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:10,238 INFO L85 PathProgramCache]: Analyzing trace with hash -205138822, now seen corresponding path program 1 times [2024-11-07 10:11:10,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:10,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868723519] [2024-11-07 10:11:10,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:10,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:10,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:10,241 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:10,244 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:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:10,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:11:10,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:10,888 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 77 treesize of output 41 [2024-11-07 10:11:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-07 10:11:10,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:10,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868723519] [2024-11-07 10:11:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868723519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054629432] [2024-11-07 10:11:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:10,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:10,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:10,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:10,934 INFO L87 Difference]: Start difference. First operand 177 states and 242 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:11:13,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:15,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:19,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:23,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:23,366 INFO L93 Difference]: Finished difference Result 311 states and 426 transitions. [2024-11-07 10:11:23,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2024-11-07 10:11:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:23,398 INFO L225 Difference]: With dead ends: 311 [2024-11-07 10:11:23,399 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 10:11:23,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:11:23,400 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 101 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:23,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 407 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2024-11-07 10:11:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 10:11:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2024-11-07 10:11:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.358974358974359) internal successors, (212), 156 states have internal predecessors, (212), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:11:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2024-11-07 10:11:23,413 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 88 [2024-11-07 10:11:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:23,413 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2024-11-07 10:11:23,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:11:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2024-11-07 10:11:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:11:23,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:23,415 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,433 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 (7)] Forceful destruction successful, exit code 0 [2024-11-07 10:11:23,615 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:23,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:23,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:23,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1014561932, now seen corresponding path program 1 times [2024-11-07 10:11:23,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:23,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934419944] [2024-11-07 10:11:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:23,616 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:23,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:23,618 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:23,620 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:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:24,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:11:24,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:24,381 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:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:11:24,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:11:24,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934419944] [2024-11-07 10:11:24,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934419944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:11:24,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:11:24,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:11:24,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632067121] [2024-11-07 10:11:24,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:24,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:24,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:24,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:11:24,432 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:11:27,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:29,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:33,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:36,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:11:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:36,747 INFO L93 Difference]: Finished difference Result 304 states and 412 transitions. [2024-11-07 10:11:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:11:36,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2024-11-07 10:11:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:36,776 INFO L225 Difference]: With dead ends: 304 [2024-11-07 10:11:36,776 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 10:11:36,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:11:36,777 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 92 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:36,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 402 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2024-11-07 10:11:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 10:11:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2024-11-07 10:11:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 156 states have internal predecessors, (210), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:11:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 238 transitions. [2024-11-07 10:11:36,792 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 238 transitions. Word has length 90 [2024-11-07 10:11:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:36,792 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 238 transitions. [2024-11-07 10:11:36,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:11:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 238 transitions. [2024-11-07 10:11:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 10:11:36,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:36,795 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,817 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:36,996 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:36,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:36,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1284278854, now seen corresponding path program 1 times [2024-11-07 10:11:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654093970] [2024-11-07 10:11:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:36,997 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:36,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:36,999 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:37,001 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:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:37,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:11:37,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:37,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:11:39,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2024-11-07 10:11:39,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:39,945 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 86 treesize of output 44 [2024-11-07 10:11:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 10:11:40,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:11:40,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:40,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654093970] [2024-11-07 10:11:40,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654093970] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:11:40,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:11:40,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2024-11-07 10:11:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582656312] [2024-11-07 10:11:40,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:11:40,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:11:40,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:40,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:11:40,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:11:40,527 INFO L87 Difference]: Start difference. First operand 177 states and 238 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:11:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:40,886 INFO L93 Difference]: Finished difference Result 319 states and 431 transitions. [2024-11-07 10:11:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:11:40,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 92 [2024-11-07 10:11:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:40,888 INFO L225 Difference]: With dead ends: 319 [2024-11-07 10:11:40,888 INFO L226 Difference]: Without dead ends: 217 [2024-11-07 10:11:40,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:11:40,889 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:40,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 618 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:11:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-07 10:11:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2024-11-07 10:11:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 176 states have (on average 1.3409090909090908) internal successors, (236), 176 states have internal predecessors, (236), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:11:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 264 transitions. [2024-11-07 10:11:40,902 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 264 transitions. Word has length 92 [2024-11-07 10:11:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:40,902 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 264 transitions. [2024-11-07 10:11:40,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:11:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2024-11-07 10:11:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:11:40,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:40,904 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,925 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:41,105 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:41,105 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:41,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash -651573371, now seen corresponding path program 1 times [2024-11-07 10:11:41,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:41,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307262883] [2024-11-07 10:11:41,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:41,106 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:41,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:41,108 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:41,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 10:11:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:11:41,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:11:41,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:11:42,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-07 10:11:43,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:11:43,195 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 42 treesize of output 20 [2024-11-07 10:11:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 10:11:43,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:11:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-07 10:11:44,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:11:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307262883] [2024-11-07 10:11:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307262883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:11:44,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:11:44,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-07 10:11:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801906611] [2024-11-07 10:11:44,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:11:44,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 10:11:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:11:44,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 10:11:44,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2024-11-07 10:11:44,591 INFO L87 Difference]: Start difference. First operand 197 states and 264 transitions. Second operand has 24 states, 20 states have (on average 6.2) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-07 10:11:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:11:46,369 INFO L93 Difference]: Finished difference Result 341 states and 458 transitions. [2024-11-07 10:11:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 10:11:46,370 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 6.2) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2024-11-07 10:11:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:11:46,373 INFO L225 Difference]: With dead ends: 341 [2024-11-07 10:11:46,374 INFO L226 Difference]: Without dead ends: 222 [2024-11-07 10:11:46,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=244, Invalid=812, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 10:11:46,376 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 690 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:11:46,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1171 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:11:46,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-07 10:11:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 197. [2024-11-07 10:11:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 176 states have (on average 1.3352272727272727) internal successors, (235), 176 states have internal predecessors, (235), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:11:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 263 transitions. [2024-11-07 10:11:46,390 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 263 transitions. Word has length 94 [2024-11-07 10:11:46,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:11:46,391 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 263 transitions. [2024-11-07 10:11:46,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 6.2) internal successors, (124), 24 states have internal predecessors, (124), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-07 10:11:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 263 transitions. [2024-11-07 10:11:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:11:46,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:11:46,393 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 10:11:46,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:11:46,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:11:46,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:11:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash 864621008, now seen corresponding path program 1 times [2024-11-07 10:11:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:11:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425205556] [2024-11-07 10:11:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:11:46,595 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:46,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:11:46,597 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:11:46,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process