./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-67.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:15:44,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:15:44,607 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:15:44,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:15:44,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:15:44,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:15:44,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:15:44,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:15:44,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:15:44,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:15:44,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:15:44,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:15:44,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:15:44,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:15:44,651 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:15:44,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:15:44,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:15:44,652 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:15:44,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:15:44,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:15:44,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:15:44,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:15:44,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:15:44,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:15:44,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:15:44,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:15:44,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:15:44,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:15:44,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:15:44,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:15:44,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:15:44,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:15:44,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:15:44,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:15:44,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:15:44,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:15:44,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:15:44,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:15:44,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:15:44,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:15:44,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:15:44,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:15:44,655 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca [2024-11-07 10:15:44,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:15:44,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:15:44,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:15:44,962 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:15:44,963 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:15:44,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2024-11-07 10:15:46,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:15:46,544 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:15:46,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2024-11-07 10:15:46,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a12e59cd7/287ed0d3ff02490db13cfa2b9bb48666/FLAGe8aa29578 [2024-11-07 10:15:46,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a12e59cd7/287ed0d3ff02490db13cfa2b9bb48666 [2024-11-07 10:15:46,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:15:46,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:15:46,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:15:46,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:15:46,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:15:46,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:15:46" (1/1) ... [2024-11-07 10:15:46,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b4f57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:46, skipping insertion in model container [2024-11-07 10:15:46,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:15:46" (1/1) ... [2024-11-07 10:15:46,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:15:47,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2024-11-07 10:15:47,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:15:47,077 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:15:47,084 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2024-11-07 10:15:47,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:15:47,128 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:15:47,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47 WrapperNode [2024-11-07 10:15:47,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:15:47,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:15:47,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:15:47,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:15:47,138 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:15:47" (1/1) ... [2024-11-07 10:15:47,154 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:15:47" (1/1) ... [2024-11-07 10:15:47,201 INFO L138 Inliner]: procedures = 29, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2024-11-07 10:15:47,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:15:47,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:15:47,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:15:47,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:15:47,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,254 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2024-11-07 10:15:47,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:15:47,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:15:47,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:15:47,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:15:47,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (1/1) ... [2024-11-07 10:15:47,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:15:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:15:47,352 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:15:47,359 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:15:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:15:47,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:15:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:15:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:15:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:15:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:15:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:15:47,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-07 10:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 10:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:15:47,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-07 10:15:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:15:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:15:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:15:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:15:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:15:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:15:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:15:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:15:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 10:15:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:15:47,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:15:47,502 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:15:47,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:15:47,924 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-07 10:15:47,924 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:15:47,933 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:15:47,933 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:15:47,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:15:47 BoogieIcfgContainer [2024-11-07 10:15:47,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:15:47,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:15:47,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:15:47,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:15:47,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:15:46" (1/3) ... [2024-11-07 10:15:47,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba0186a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:15:47, skipping insertion in model container [2024-11-07 10:15:47,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:15:47" (2/3) ... [2024-11-07 10:15:47,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba0186a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:15:47, skipping insertion in model container [2024-11-07 10:15:47,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:15:47" (3/3) ... [2024-11-07 10:15:47,942 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-67.i [2024-11-07 10:15:47,954 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:15:47,954 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:15:48,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:15:48,020 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;@3f4bbe31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:15:48,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:15:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:15:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:15:48,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:48,035 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:48,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:48,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1396846781, now seen corresponding path program 1 times [2024-11-07 10:15:48,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:48,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927491396] [2024-11-07 10:15:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:48,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927491396] [2024-11-07 10:15:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927491396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:48,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:48,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:15:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266121301] [2024-11-07 10:15:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:48,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:15:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:48,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:15:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:15:48,472 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:15:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:48,497 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2024-11-07 10:15:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:15:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-07 10:15:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:48,506 INFO L225 Difference]: With dead ends: 179 [2024-11-07 10:15:48,506 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:15:48,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:15:48,513 INFO L432 NwaCegarLoop]: 126 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, 126 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:15:48,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:15:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:15:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-07 10:15:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:15:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-07 10:15:48,550 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2024-11-07 10:15:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:48,551 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-07 10:15:48,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:15:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-07 10:15:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:15:48,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:48,553 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:48,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:15:48,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:48,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2119067347, now seen corresponding path program 1 times [2024-11-07 10:15:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:48,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649393429] [2024-11-07 10:15:48,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:48,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:48,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:48,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649393429] [2024-11-07 10:15:48,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649393429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:48,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:48,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:15:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254159934] [2024-11-07 10:15:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:48,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:15:48,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:48,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:15:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:15:48,923 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:15:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:48,976 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2024-11-07 10:15:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:15:48,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-07 10:15:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:48,980 INFO L225 Difference]: With dead ends: 177 [2024-11-07 10:15:48,980 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:15:48,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:15:48,981 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 361 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:15:48,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:15:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:15:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-07 10:15:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:15:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-07 10:15:49,000 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2024-11-07 10:15:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:49,001 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-07 10:15:49,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:15:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-07 10:15:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:15:49,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:49,004 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:49,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:15:49,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:49,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1532791125, now seen corresponding path program 1 times [2024-11-07 10:15:49,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:49,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703419668] [2024-11-07 10:15:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:49,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:49,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:49,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703419668] [2024-11-07 10:15:49,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703419668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:49,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:49,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:15:49,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848166818] [2024-11-07 10:15:49,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:49,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:15:49,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:15:49,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:15:49,311 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:49,356 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2024-11-07 10:15:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:15:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:15:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:49,362 INFO L225 Difference]: With dead ends: 182 [2024-11-07 10:15:49,362 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 10:15:49,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:15:49,363 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:49,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:15:49,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 10:15:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-07 10:15:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:15:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-07 10:15:49,376 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2024-11-07 10:15:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:49,378 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-07 10:15:49,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-07 10:15:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:15:49,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:49,380 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:49,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:15:49,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:49,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -852732755, now seen corresponding path program 1 times [2024-11-07 10:15:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:49,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183215247] [2024-11-07 10:15:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183215247] [2024-11-07 10:15:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183215247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:15:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288217753] [2024-11-07 10:15:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:49,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:15:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:49,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:15:49,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:15:49,611 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:49,647 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2024-11-07 10:15:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:15:49,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:15:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:49,650 INFO L225 Difference]: With dead ends: 186 [2024-11-07 10:15:49,652 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 10:15:49,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:15:49,654 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:49,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:15:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 10:15:49,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-07 10:15:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:15:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-07 10:15:49,667 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2024-11-07 10:15:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:49,668 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-07 10:15:49,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-07 10:15:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:15:49,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:49,669 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:49,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:15:49,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:49,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash 922274607, now seen corresponding path program 1 times [2024-11-07 10:15:49,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:49,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714197374] [2024-11-07 10:15:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:49,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:49,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714197374] [2024-11-07 10:15:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714197374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:15:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855768346] [2024-11-07 10:15:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:49,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:15:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:15:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:15:49,871 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:49,899 INFO L93 Difference]: Finished difference Result 190 states and 265 transitions. [2024-11-07 10:15:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:15:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:15:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:49,903 INFO L225 Difference]: With dead ends: 190 [2024-11-07 10:15:49,903 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 10:15:49,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:15:49,905 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:49,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:15:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 10:15:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-07 10:15:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:15:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 134 transitions. [2024-11-07 10:15:49,912 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 134 transitions. Word has length 104 [2024-11-07 10:15:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:49,913 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 134 transitions. [2024-11-07 10:15:49,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2024-11-07 10:15:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:15:49,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:49,914 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:49,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:15:49,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:49,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash 924121649, now seen corresponding path program 1 times [2024-11-07 10:15:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941210938] [2024-11-07 10:15:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:53,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941210938] [2024-11-07 10:15:53,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941210938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:53,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:53,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:15:53,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003892434] [2024-11-07 10:15:53,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:53,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:15:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:53,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:15:53,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:15:53,186 INFO L87 Difference]: Start difference. First operand 97 states and 134 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 10:15:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:54,682 INFO L93 Difference]: Finished difference Result 354 states and 487 transitions. [2024-11-07 10:15:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:15:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2024-11-07 10:15:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:54,684 INFO L225 Difference]: With dead ends: 354 [2024-11-07 10:15:54,684 INFO L226 Difference]: Without dead ends: 260 [2024-11-07 10:15:54,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-07 10:15:54,686 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 452 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:54,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1298 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:15:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-07 10:15:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2024-11-07 10:15:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 172 states have internal predecessors, (231), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:15:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 267 transitions. [2024-11-07 10:15:54,727 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 267 transitions. Word has length 104 [2024-11-07 10:15:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:54,728 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 267 transitions. [2024-11-07 10:15:54,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 10:15:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 267 transitions. [2024-11-07 10:15:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 10:15:54,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:54,730 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:54,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:15:54,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:54,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash -881316685, now seen corresponding path program 1 times [2024-11-07 10:15:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:54,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126696644] [2024-11-07 10:15:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:54,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126696644] [2024-11-07 10:15:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126696644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:54,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:54,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:15:54,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192535572] [2024-11-07 10:15:54,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:54,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:15:54,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:15:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:15:54,821 INFO L87 Difference]: Start difference. First operand 193 states and 267 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:54,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:54,849 INFO L93 Difference]: Finished difference Result 422 states and 581 transitions. [2024-11-07 10:15:54,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:15:54,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-07 10:15:54,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:54,853 INFO L225 Difference]: With dead ends: 422 [2024-11-07 10:15:54,855 INFO L226 Difference]: Without dead ends: 232 [2024-11-07 10:15:54,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:15:54,857 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:54,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 315 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:15:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-07 10:15:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 191. [2024-11-07 10:15:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 170 states have internal predecessors, (227), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:15:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 263 transitions. [2024-11-07 10:15:54,888 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 263 transitions. Word has length 104 [2024-11-07 10:15:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:54,891 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 263 transitions. [2024-11-07 10:15:54,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 263 transitions. [2024-11-07 10:15:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:15:54,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:54,892 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:54,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:15:54,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:54,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1391276551, now seen corresponding path program 1 times [2024-11-07 10:15:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:54,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606684166] [2024-11-07 10:15:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:55,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606684166] [2024-11-07 10:15:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606684166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:55,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:55,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:15:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203600264] [2024-11-07 10:15:55,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:55,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:15:55,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:15:55,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:15:55,864 INFO L87 Difference]: Start difference. First operand 191 states and 263 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:15:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:56,034 INFO L93 Difference]: Finished difference Result 382 states and 525 transitions. [2024-11-07 10:15:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:15:56,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-11-07 10:15:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:56,037 INFO L225 Difference]: With dead ends: 382 [2024-11-07 10:15:56,037 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 10:15:56,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:15:56,038 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 92 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:56,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 631 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:15:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 10:15:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 178. [2024-11-07 10:15:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 157 states have internal predecessors, (206), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:15:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 242 transitions. [2024-11-07 10:15:56,056 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 242 transitions. Word has length 105 [2024-11-07 10:15:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:56,057 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 242 transitions. [2024-11-07 10:15:56,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:15:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 242 transitions. [2024-11-07 10:15:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-07 10:15:56,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:56,058 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:56,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:15:56,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:56,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:56,059 INFO L85 PathProgramCache]: Analyzing trace with hash 658834688, now seen corresponding path program 1 times [2024-11-07 10:15:56,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:56,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221560113] [2024-11-07 10:15:56,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:56,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:56,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221560113] [2024-11-07 10:15:56,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221560113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:56,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:56,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:15:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459166343] [2024-11-07 10:15:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:56,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:15:56,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:56,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:15:56,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:15:56,664 INFO L87 Difference]: Start difference. First operand 178 states and 242 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:15:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:56,902 INFO L93 Difference]: Finished difference Result 516 states and 701 transitions. [2024-11-07 10:15:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:15:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-07 10:15:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:56,905 INFO L225 Difference]: With dead ends: 516 [2024-11-07 10:15:56,905 INFO L226 Difference]: Without dead ends: 341 [2024-11-07 10:15:56,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:15:56,906 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 97 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:56,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 836 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:15:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-07 10:15:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2024-11-07 10:15:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 297 states have (on average 1.3131313131313131) internal successors, (390), 300 states have internal predecessors, (390), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:15:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 458 transitions. [2024-11-07 10:15:56,941 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 458 transitions. Word has length 108 [2024-11-07 10:15:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:56,941 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 458 transitions. [2024-11-07 10:15:56,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:15:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 458 transitions. [2024-11-07 10:15:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:15:56,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:56,943 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:56,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:15:56,943 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:56,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1501200389, now seen corresponding path program 1 times [2024-11-07 10:15:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641451004] [2024-11-07 10:15:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641451004] [2024-11-07 10:15:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641451004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:57,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:57,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:15:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237588371] [2024-11-07 10:15:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:57,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:15:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:57,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:15:57,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:15:57,159 INFO L87 Difference]: Start difference. First operand 338 states and 458 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:57,496 INFO L93 Difference]: Finished difference Result 836 states and 1135 transitions. [2024-11-07 10:15:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:15:57,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-07 10:15:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:57,502 INFO L225 Difference]: With dead ends: 836 [2024-11-07 10:15:57,502 INFO L226 Difference]: Without dead ends: 501 [2024-11-07 10:15:57,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:15:57,503 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 98 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:57,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 910 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:15:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-07 10:15:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 369. [2024-11-07 10:15:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 328 states have (on average 1.3323170731707317) internal successors, (437), 331 states have internal predecessors, (437), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:15:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 505 transitions. [2024-11-07 10:15:57,548 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 505 transitions. Word has length 110 [2024-11-07 10:15:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:57,549 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 505 transitions. [2024-11-07 10:15:57,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 505 transitions. [2024-11-07 10:15:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:15:57,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:57,551 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:57,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:15:57,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:57,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:57,552 INFO L85 PathProgramCache]: Analyzing trace with hash 952153733, now seen corresponding path program 1 times [2024-11-07 10:15:57,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:57,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624956897] [2024-11-07 10:15:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:57,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:57,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624956897] [2024-11-07 10:15:57,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624956897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:57,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:57,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:15:57,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616824763] [2024-11-07 10:15:57,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:57,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:15:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:57,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:15:57,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:15:57,799 INFO L87 Difference]: Start difference. First operand 369 states and 505 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:58,088 INFO L93 Difference]: Finished difference Result 880 states and 1201 transitions. [2024-11-07 10:15:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:15:58,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-11-07 10:15:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:58,093 INFO L225 Difference]: With dead ends: 880 [2024-11-07 10:15:58,094 INFO L226 Difference]: Without dead ends: 514 [2024-11-07 10:15:58,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:15:58,098 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 88 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:58,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 885 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:15:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-07 10:15:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 395. [2024-11-07 10:15:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 354 states have (on average 1.3418079096045197) internal successors, (475), 357 states have internal predecessors, (475), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:15:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 543 transitions. [2024-11-07 10:15:58,147 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 543 transitions. Word has length 110 [2024-11-07 10:15:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:58,147 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 543 transitions. [2024-11-07 10:15:58,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 543 transitions. [2024-11-07 10:15:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:15:58,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:58,149 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:58,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:15:58,150 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:58,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:58,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1267966515, now seen corresponding path program 1 times [2024-11-07 10:15:58,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:58,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666711202] [2024-11-07 10:15:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:58,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:58,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666711202] [2024-11-07 10:15:58,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666711202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:58,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:58,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:15:58,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959153029] [2024-11-07 10:15:58,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:58,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:15:58,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:58,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:15:58,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:15:58,326 INFO L87 Difference]: Start difference. First operand 395 states and 543 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:58,500 INFO L93 Difference]: Finished difference Result 908 states and 1238 transitions. [2024-11-07 10:15:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:15:58,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-07 10:15:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:58,503 INFO L225 Difference]: With dead ends: 908 [2024-11-07 10:15:58,503 INFO L226 Difference]: Without dead ends: 516 [2024-11-07 10:15:58,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:15:58,505 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 88 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:58,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 563 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:15:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-07 10:15:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 278. [2024-11-07 10:15:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 249 states have (on average 1.3493975903614457) internal successors, (336), 250 states have internal predecessors, (336), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:15:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 380 transitions. [2024-11-07 10:15:58,534 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 380 transitions. Word has length 111 [2024-11-07 10:15:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:58,535 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 380 transitions. [2024-11-07 10:15:58,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 380 transitions. [2024-11-07 10:15:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:15:58,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:58,537 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:58,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:15:58,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:58,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:58,537 INFO L85 PathProgramCache]: Analyzing trace with hash 983159884, now seen corresponding path program 1 times [2024-11-07 10:15:58,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:58,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011132747] [2024-11-07 10:15:58,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:15:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:15:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:15:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:15:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:15:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:15:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 10:15:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:15:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:15:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:15:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 10:15:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:15:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:15:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:15:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:15:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011132747] [2024-11-07 10:15:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011132747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:15:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:15:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:15:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657571353] [2024-11-07 10:15:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:15:58,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:15:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:15:58,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:15:58,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:15:58,688 INFO L87 Difference]: Start difference. First operand 278 states and 380 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:15:58,853 INFO L93 Difference]: Finished difference Result 662 states and 901 transitions. [2024-11-07 10:15:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:15:58,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-11-07 10:15:58,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:15:58,856 INFO L225 Difference]: With dead ends: 662 [2024-11-07 10:15:58,857 INFO L226 Difference]: Without dead ends: 387 [2024-11-07 10:15:58,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:15:58,858 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 85 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:15:58,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 542 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:15:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-07 10:15:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 277. [2024-11-07 10:15:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 248 states have (on average 1.342741935483871) internal successors, (333), 249 states have internal predecessors, (333), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:15:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 377 transitions. [2024-11-07 10:15:58,884 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 377 transitions. Word has length 111 [2024-11-07 10:15:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:15:58,885 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 377 transitions. [2024-11-07 10:15:58,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:15:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 377 transitions. [2024-11-07 10:15:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 10:15:58,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:15:58,886 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:15:58,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:15:58,886 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:15:58,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:15:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1038331780, now seen corresponding path program 1 times [2024-11-07 10:15:58,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:15:58,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123375457] [2024-11-07 10:15:58,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:15:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:15:58,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396244028] [2024-11-07 10:15:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:15:58,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:15:58,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:15:58,973 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:15:58,974 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:15:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:15:59,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:15:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:15:59,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:15:59,783 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:15:59,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:15:59,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:15:59,986 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,SelfDestructingSolverStorable13 [2024-11-07 10:15:59,990 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:00,098 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:16:00,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:16:00 BoogieIcfgContainer [2024-11-07 10:16:00,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:16:00,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:16:00,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:16:00,101 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:16:00,102 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:15:47" (3/4) ... [2024-11-07 10:16:00,104 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:16:00,104 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:16:00,106 INFO L158 Benchmark]: Toolchain (without parser) took 13220.72ms. Allocated memory was 100.7MB in the beginning and 327.2MB in the end (delta: 226.5MB). Free memory was 76.6MB in the beginning and 249.4MB in the end (delta: -172.8MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-07 10:16:00,106 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:16:00,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.77ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 62.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:16:00,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.92ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 59.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:16:00,106 INFO L158 Benchmark]: Boogie Preprocessor took 110.05ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 54.9MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:16:00,106 INFO L158 Benchmark]: RCFGBuilder took 620.35ms. Allocated memory is still 100.7MB. Free memory was 54.9MB in the beginning and 61.8MB in the end (delta: -6.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-07 10:16:00,107 INFO L158 Benchmark]: TraceAbstraction took 12165.35ms. Allocated memory was 100.7MB in the beginning and 327.2MB in the end (delta: 226.5MB). Free memory was 61.3MB in the beginning and 249.5MB in the end (delta: -188.2MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2024-11-07 10:16:00,107 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 327.2MB. Free memory was 249.5MB in the beginning and 249.4MB in the end (delta: 53.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:16:00,110 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.42ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.77ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 62.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.92ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 59.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 110.05ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 54.9MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 620.35ms. Allocated memory is still 100.7MB. Free memory was 54.9MB in the beginning and 61.8MB in the end (delta: -6.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12165.35ms. Allocated memory was 100.7MB in the beginning and 327.2MB in the end (delta: 226.5MB). Free memory was 61.3MB in the beginning and 249.5MB in the end (delta: -188.2MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 327.2MB. Free memory was 249.5MB in the beginning and 249.4MB in the end (delta: 53.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of shiftRight at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[1] = { 25.875 }; [L25-L27] double double_Array_0[1] = { 25.875 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L28-L30] float float_Array_0[2] = { 0.9, 15.125 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L31-L33] signed long int signed_long_int_Array_0[2] = { -4, 50 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L34-L36] signed short int signed_short_int_Array_0[3] = { 256, -64, 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[3] = { 256, 50, 128 }; [L40] signed long int last_1_signed_long_int_Array_0_1_ = 50; [L41] signed short int last_1_signed_short_int_Array_0_2_ = 2; [L42] unsigned short int last_1_unsigned_short_int_Array_0_2_ = 128; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L95] EXPR signed_long_int_Array_0[1] [L95] last_1_signed_long_int_Array_0_1_ = signed_long_int_Array_0[1] [L96] EXPR signed_short_int_Array_0[2] [L96] last_1_signed_short_int_Array_0_2_ = signed_short_int_Array_0[2] [L97] EXPR unsigned_short_int_Array_0[2] [L97] last_1_unsigned_short_int_Array_0_2_ = unsigned_short_int_Array_0[2] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] float_Array_0[0] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L79] EXPR float_Array_0[0] [L79] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L81] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L85] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L88] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L108] RET updateVariables() [L109] CALL step() [L46] COND TRUE ! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_) [L47] EXPR signed_short_int_Array_0[1] [L47] EXPR signed_short_int_Array_0[0] [L47] signed_short_int_Array_0[2] = (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]) [L49] EXPR signed_short_int_Array_0[1] [L49] signed long int stepLocal_0 = 1 * signed_short_int_Array_0[1]; [L50] EXPR signed_short_int_Array_0[2] [L50] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=12850, unsigned_short_int_Array_0={9:0}] [L50] COND TRUE (signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > stepLocal_0 [L51] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] EXPR (((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0) [L51] EXPR unsigned_short_int_Array_0[0] [L51] EXPR (((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L51] unsigned_short_int_Array_0[2] = (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))) [L55] EXPR float_Array_0[0] [L55] float_Array_0[1] = float_Array_0[0] [L56] EXPR float_Array_0[0] [L56] double_Array_0[0] = float_Array_0[0] [L57] EXPR unsigned_short_int_Array_0[0] [L57] unsigned_short_int_Array_0[1] = unsigned_short_int_Array_0[0] [L58] EXPR signed_short_int_Array_0[1] [L58] EXPR signed_long_int_Array_0[0] [L58] signed long int stepLocal_2 = signed_short_int_Array_0[1] / signed_long_int_Array_0[0]; [L59] EXPR unsigned_short_int_Array_0[0] [L59] unsigned short int stepLocal_1 = unsigned_short_int_Array_0[0]; [L60] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L60] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L63] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(unsigned_short_int_Array_0[1] > stepLocal_2) [L70] EXPR unsigned_short_int_Array_0[2] [L70] EXPR signed_short_int_Array_0[0] [L70] signed_long_int_Array_0[1] = (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR signed_short_int_Array_0[0] [L100] EXPR (! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) [L100] EXPR signed_short_int_Array_0[2] [L100] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR signed_short_int_Array_0[2] >> signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) [L100] EXPR unsigned_short_int_Array_0[2] [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR ((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR (((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] EXPR ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100-L101] return ((((((! (last_1_unsigned_short_int_Array_0_2_ <= last_1_signed_short_int_Array_0_2_)) ? (signed_short_int_Array_0[2] == ((signed short int) (signed_short_int_Array_0[1] + signed_short_int_Array_0[0]))) : 1) && (((signed_short_int_Array_0[2] >> signed_short_int_Array_0[0]) > (1 * signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[2] == ((unsigned short int) (((((42286 - unsigned_short_int_Array_0[0])) > (0)) ? ((42286 - unsigned_short_int_Array_0[0])) : (0))))) : (unsigned_short_int_Array_0[2] == ((unsigned short int) unsigned_short_int_Array_0[0])))) && (BOOL_unsigned_char_Array_0[0] ? (signed_long_int_Array_0[1] == ((signed long int) ((((unsigned_short_int_Array_0[2]) < (last_1_signed_long_int_Array_0_1_)) ? (unsigned_short_int_Array_0[2]) : (last_1_signed_long_int_Array_0_1_))))) : ((unsigned_short_int_Array_0[1] > (signed_short_int_Array_0[1] / signed_long_int_Array_0[0])) ? ((unsigned_short_int_Array_0[0] > unsigned_short_int_Array_0[2]) ? (signed_long_int_Array_0[1] == ((signed long int) ((((signed_short_int_Array_0[1]) < (100)) ? (signed_short_int_Array_0[1]) : (100))))) : (signed_long_int_Array_0[1] == ((signed long int) (last_1_signed_long_int_Array_0_1_ - unsigned_short_int_Array_0[0])))) : (signed_long_int_Array_0[1] == ((signed long int) (unsigned_short_int_Array_0[2] + signed_short_int_Array_0[0])))))) && (float_Array_0[1] == ((float) float_Array_0[0]))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_short_int_Array_0[1] == ((unsigned short int) unsigned_short_int_Array_0[0])) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_signed_long_int_Array_0_1_=50, last_1_signed_short_int_Array_0_2_=2, last_1_unsigned_short_int_Array_0_2_=128, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1066 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1064 mSDsluCounter, 7545 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5574 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1670 IncrementalHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 1971 mSDtfsCounter, 1670 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=11, InterpolantAutomatonStates: 77, 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, 13 MinimizatonAttempts, 729 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1607 NumberOfCodeBlocks, 1607 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1370 ConstructedInterpolants, 0 QuantifiedInterpolants, 4404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 3432/3432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:16:00,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:16:02,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:16:02,430 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:16:02,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:16:02,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:16:02,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:16:02,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:16:02,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:16:02,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:16:02,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:16:02,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:16:02,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:16:02,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:16:02,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:16:02,470 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:16:02,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:16:02,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:16:02,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:16:02,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:16:02,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:16:02,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:16:02,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:16:02,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:16:02,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:16:02,473 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:16:02,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:16:02,474 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:16:02,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:16:02,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:16:02,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:16:02,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:16:02,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:16:02,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:16:02,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:16:02,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:16:02,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:16:02,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:16:02,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:16:02,476 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:16:02,476 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:16:02,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:16:02,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:16:02,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:16:02,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:16:02,477 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60e0d367a188d63fa8b46fcc4be9e9d24b19690e82d361011ef9ebf2c61f53ca [2024-11-07 10:16:02,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:16:02,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:16:02,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:16:02,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:16:02,789 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:16:02,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2024-11-07 10:16:04,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:16:04,337 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:16:04,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i [2024-11-07 10:16:04,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ce3f36b3/6fbceaea133d4cc7a609c9b3493e6b50/FLAG5fc398773 [2024-11-07 10:16:04,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ce3f36b3/6fbceaea133d4cc7a609c9b3493e6b50 [2024-11-07 10:16:04,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:16:04,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:16:04,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:16:04,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:16:04,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:16:04,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ae0162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04, skipping insertion in model container [2024-11-07 10:16:04,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:16:04,535 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2024-11-07 10:16:04,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:16:04,612 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:16:04,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-67.i[916,929] [2024-11-07 10:16:04,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:16:04,682 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:16:04,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04 WrapperNode [2024-11-07 10:16:04,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:16:04,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:16:04,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:16:04,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:16:04,690 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:16:04" (1/1) ... [2024-11-07 10:16:04,706 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:16:04" (1/1) ... [2024-11-07 10:16:04,741 INFO L138 Inliner]: procedures = 39, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 392 [2024-11-07 10:16:04,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:16:04,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:16:04,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:16:04,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:16:04,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,792 INFO L175 MemorySlicer]: Split 106 memory accesses to 7 slices as follows [2, 6, 3, 13, 17, 30, 35]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 2, 2, 3, 3]. The 16 writes are split as follows [0, 1, 1, 2, 5, 3, 4]. [2024-11-07 10:16:04,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:16:04,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:16:04,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:16:04,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:16:04,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (1/1) ... [2024-11-07 10:16:04,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:16:04,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:16:04,879 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:16:04,883 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:16:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:16:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:16:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:16:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-07 10:16:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-07 10:16:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-07 10:16:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-07 10:16:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-07 10:16:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:16:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:16:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-07 10:16:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-07 10:16:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-07 10:16:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-07 10:16:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-07 10:16:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:16:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:16:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:16:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:16:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:16:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:16:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-07 10:16:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:16:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:16:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:16:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:16:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:16:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-07 10:16:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-07 10:16:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:16:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:16:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:16:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:16:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:16:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:16:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-07 10:16:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:16:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:16:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:16:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:16:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 10:16:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 10:16:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:16:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:16:04,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:16:04,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:16:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-07 10:16:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-07 10:16:05,122 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:16:05,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:16:05,882 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-07 10:16:05,882 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:16:05,891 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:16:05,892 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:16:05,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:16:05 BoogieIcfgContainer [2024-11-07 10:16:05,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:16:05,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:16:05,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:16:05,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:16:05,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:16:04" (1/3) ... [2024-11-07 10:16:05,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de4dfad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:16:05, skipping insertion in model container [2024-11-07 10:16:05,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:16:04" (2/3) ... [2024-11-07 10:16:05,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de4dfad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:16:05, skipping insertion in model container [2024-11-07 10:16:05,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:16:05" (3/3) ... [2024-11-07 10:16:05,901 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-67.i [2024-11-07 10:16:05,912 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:16:05,912 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:16:05,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:16:05,961 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;@59de88f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:16:05,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:16:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:16:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:16:05,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:05,975 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:05,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:05,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:05,980 INFO L85 PathProgramCache]: Analyzing trace with hash -5467384, now seen corresponding path program 1 times [2024-11-07 10:16:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:05,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045915179] [2024-11-07 10:16:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:05,992 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:16:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:05,995 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:16:05,998 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:16:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:06,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:16:06,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-07 10:16:06,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:06,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:06,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045915179] [2024-11-07 10:16:06,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045915179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:06,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:06,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:16:06,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636920442] [2024-11-07 10:16:06,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:06,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:16:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:06,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:16:06,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:16:06,513 INFO L87 Difference]: Start difference. First operand has 88 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 74 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:06,544 INFO L93 Difference]: Finished difference Result 169 states and 258 transitions. [2024-11-07 10:16:06,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:16:06,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-07 10:16:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:06,553 INFO L225 Difference]: With dead ends: 169 [2024-11-07 10:16:06,553 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 10:16:06,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:16:06,561 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:06,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:16:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 10:16:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 10:16:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:16:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2024-11-07 10:16:06,606 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2024-11-07 10:16:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:06,608 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2024-11-07 10:16:06,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2024-11-07 10:16:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:16:06,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:06,614 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:06,626 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:16:06,818 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:16:06,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:06,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 712400024, now seen corresponding path program 1 times [2024-11-07 10:16:06,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:06,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988891799] [2024-11-07 10:16:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:06,821 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:16:06,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:06,825 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:16:06,827 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:16:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:07,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:16:07,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-07 10:16:07,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:07,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988891799] [2024-11-07 10:16:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988891799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:07,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:07,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:16:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706120628] [2024-11-07 10:16:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:07,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:16:07,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:16:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:16:07,242 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:07,304 INFO L93 Difference]: Finished difference Result 167 states and 238 transitions. [2024-11-07 10:16:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:16:07,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2024-11-07 10:16:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:07,308 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:16:07,309 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 10:16:07,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 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:16:07,310 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 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:16:07,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:16:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 10:16:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 10:16:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:16:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2024-11-07 10:16:07,321 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 103 [2024-11-07 10:16:07,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:07,325 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2024-11-07 10:16:07,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2024-11-07 10:16:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:16:07,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:07,327 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:07,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:16:07,527 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:16:07,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:07,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1623992486, now seen corresponding path program 1 times [2024-11-07 10:16:07,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:07,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963245851] [2024-11-07 10:16:07,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:07,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:07,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:07,532 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:16:07,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 10:16:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:07,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:16:07,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:07,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:07,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:07,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963245851] [2024-11-07 10:16:07,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963245851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:07,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:07,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:16:07,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539093327] [2024-11-07 10:16:07,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:07,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:16:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:07,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:16:07,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:16:07,898 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:07,968 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2024-11-07 10:16:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:16:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:16:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:07,970 INFO L225 Difference]: With dead ends: 174 [2024-11-07 10:16:07,970 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:16:07,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:16:07,971 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:07,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:16:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:16:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-07 10:16:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:16:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2024-11-07 10:16:07,979 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2024-11-07 10:16:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:07,980 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2024-11-07 10:16:07,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2024-11-07 10:16:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:16:07,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:07,981 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:07,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-07 10:16:08,182 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:16:08,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:08,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -943934116, now seen corresponding path program 1 times [2024-11-07 10:16:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820741114] [2024-11-07 10:16:08,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:08,184 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:16:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:08,186 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:16:08,187 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:16:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:08,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:16:08,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:08,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:08,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:08,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820741114] [2024-11-07 10:16:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820741114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:16:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494832326] [2024-11-07 10:16:08,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:08,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:16:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:08,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:16:08,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:16:08,577 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:08,737 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2024-11-07 10:16:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:16:08,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:16:08,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:08,739 INFO L225 Difference]: With dead ends: 180 [2024-11-07 10:16:08,739 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 10:16:08,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:16:08,740 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:08,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:16:08,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 10:16:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-07 10:16:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:16:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2024-11-07 10:16:08,748 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2024-11-07 10:16:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:08,749 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2024-11-07 10:16:08,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2024-11-07 10:16:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:16:08,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:08,751 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:08,762 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:16:08,951 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:16:08,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash 831073246, now seen corresponding path program 1 times [2024-11-07 10:16:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353101623] [2024-11-07 10:16:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:08,953 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:16:08,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:08,956 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:16:08,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 10:16:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:09,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:16:09,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:09,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:09,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:09,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353101623] [2024-11-07 10:16:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353101623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:09,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:09,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:16:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941424910] [2024-11-07 10:16:09,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:09,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:16:09,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:09,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:16:09,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:16:09,278 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:09,417 INFO L93 Difference]: Finished difference Result 184 states and 255 transitions. [2024-11-07 10:16:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:16:09,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:16:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:09,419 INFO L225 Difference]: With dead ends: 184 [2024-11-07 10:16:09,419 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 10:16:09,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:16:09,421 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:09,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:16:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 10:16:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-11-07 10:16:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:16:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2024-11-07 10:16:09,428 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 103 [2024-11-07 10:16:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:09,428 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2024-11-07 10:16:09,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2024-11-07 10:16:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:16:09,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:09,430 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:09,440 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:16:09,634 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:16:09,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:09,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash 832920288, now seen corresponding path program 1 times [2024-11-07 10:16:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297106749] [2024-11-07 10:16:09,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:09,636 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:16:09,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:09,638 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:16:09,639 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:16:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:09,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 10:16:10,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:10,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:16:10,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-07 10:16:11,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:11,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 58 [2024-11-07 10:16:12,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:12,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 74 [2024-11-07 10:16:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 170 proven. 24 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-07 10:16:12,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:16:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:12,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:12,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297106749] [2024-11-07 10:16:12,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297106749] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:16:12,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:16:12,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 28 [2024-11-07 10:16:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73756324] [2024-11-07 10:16:12,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:12,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:16:12,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:12,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:16:12,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2024-11-07 10:16:12,686 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:13,398 INFO L93 Difference]: Finished difference Result 287 states and 394 transitions. [2024-11-07 10:16:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:16:13,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:16:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:13,400 INFO L225 Difference]: With dead ends: 287 [2024-11-07 10:16:13,400 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 10:16:13,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2024-11-07 10:16:13,402 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 195 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:13,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 613 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:16:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 10:16:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 168. [2024-11-07 10:16:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 148 states have internal predecessors, (195), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:16:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 231 transitions. [2024-11-07 10:16:13,429 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 231 transitions. Word has length 103 [2024-11-07 10:16:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:13,430 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 231 transitions. [2024-11-07 10:16:13,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 231 transitions. [2024-11-07 10:16:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 10:16:13,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:13,435 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:13,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 10:16:13,636 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:16:13,636 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:13,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1051775006, now seen corresponding path program 1 times [2024-11-07 10:16:13,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:13,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803866669] [2024-11-07 10:16:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:13,637 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:16:13,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:13,639 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:16:13,640 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:16:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:13,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:16:13,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:13,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 10:16:13,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 10:16:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:14,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:14,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:14,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803866669] [2024-11-07 10:16:14,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803866669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:14,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:14,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:16:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446802377] [2024-11-07 10:16:14,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:14,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:16:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:14,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:16:14,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:16:14,371 INFO L87 Difference]: Start difference. First operand 168 states and 231 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:14,682 INFO L93 Difference]: Finished difference Result 427 states and 586 transitions. [2024-11-07 10:16:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:16:14,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-11-07 10:16:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:14,689 INFO L225 Difference]: With dead ends: 427 [2024-11-07 10:16:14,691 INFO L226 Difference]: Without dead ends: 262 [2024-11-07 10:16:14,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:16:14,692 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 93 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:14,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 301 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:16:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-07 10:16:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 225. [2024-11-07 10:16:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 190 states have (on average 1.305263157894737) internal successors, (248), 191 states have internal predecessors, (248), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 10:16:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 308 transitions. [2024-11-07 10:16:14,724 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 308 transitions. Word has length 103 [2024-11-07 10:16:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:14,724 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 308 transitions. [2024-11-07 10:16:14,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 308 transitions. [2024-11-07 10:16:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 10:16:14,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:14,726 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:14,738 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:16:14,926 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:16:14,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:14,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash 258220178, now seen corresponding path program 1 times [2024-11-07 10:16:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:14,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826953670] [2024-11-07 10:16:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:14,927 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:16:14,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:14,929 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:16:14,930 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:16:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:15,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-07 10:16:15,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:15,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:16:15,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:16:16,244 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 42 treesize of output 20 [2024-11-07 10:16:16,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-11-07 10:16:16,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:16,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2024-11-07 10:16:16,372 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 40 treesize of output 22 [2024-11-07 10:16:16,376 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 20 treesize of output 12 [2024-11-07 10:16:18,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:18,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 45 [2024-11-07 10:16:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 197 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-07 10:16:18,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:16:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:19,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:19,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826953670] [2024-11-07 10:16:19,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826953670] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:16:19,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:16:19,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [25] total 30 [2024-11-07 10:16:19,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152298586] [2024-11-07 10:16:19,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:19,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:16:19,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:19,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:16:19,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2024-11-07 10:16:19,855 INFO L87 Difference]: Start difference. First operand 225 states and 308 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:21,685 INFO L93 Difference]: Finished difference Result 561 states and 769 transitions. [2024-11-07 10:16:21,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:16:21,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-11-07 10:16:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:21,688 INFO L225 Difference]: With dead ends: 561 [2024-11-07 10:16:21,688 INFO L226 Difference]: Without dead ends: 396 [2024-11-07 10:16:21,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 10:16:21,690 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 196 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:21,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 781 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 10:16:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-07 10:16:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2024-11-07 10:16:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 339 states have (on average 1.3126843657817109) internal successors, (445), 342 states have internal predecessors, (445), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 10:16:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 537 transitions. [2024-11-07 10:16:21,725 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 537 transitions. Word has length 105 [2024-11-07 10:16:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:21,725 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 537 transitions. [2024-11-07 10:16:21,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 537 transitions. [2024-11-07 10:16:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:16:21,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:21,727 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:21,739 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:16:21,928 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:16:21,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:21,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1786301513, now seen corresponding path program 1 times [2024-11-07 10:16:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:21,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644045874] [2024-11-07 10:16:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:21,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:21,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:21,932 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:16:21,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 10:16:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:22,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:16:22,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:22,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:22,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 38 [2024-11-07 10:16:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:22,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:22,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644045874] [2024-11-07 10:16:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644045874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:16:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562859637] [2024-11-07 10:16:22,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:22,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:16:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:22,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:16:22,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:16:22,702 INFO L87 Difference]: Start difference. First operand 393 states and 537 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:24,444 INFO L93 Difference]: Finished difference Result 722 states and 986 transitions. [2024-11-07 10:16:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:16:24,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:16:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:24,448 INFO L225 Difference]: With dead ends: 722 [2024-11-07 10:16:24,448 INFO L226 Difference]: Without dead ends: 403 [2024-11-07 10:16:24,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:16:24,451 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 86 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:24,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 635 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 10:16:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-07 10:16:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 339. [2024-11-07 10:16:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 291 states have (on average 1.3127147766323024) internal successors, (382), 293 states have internal predecessors, (382), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:16:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 462 transitions. [2024-11-07 10:16:24,481 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 462 transitions. Word has length 107 [2024-11-07 10:16:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:24,482 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 462 transitions. [2024-11-07 10:16:24,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 462 transitions. [2024-11-07 10:16:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-07 10:16:24,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:24,483 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:24,496 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 (10)] Forceful destruction successful, exit code 0 [2024-11-07 10:16:24,684 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:16:24,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:24,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash 859106871, now seen corresponding path program 1 times [2024-11-07 10:16:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:24,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997217545] [2024-11-07 10:16:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:24,685 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:16:24,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:24,687 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:16:24,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 10:16:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:24,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:16:24,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:25,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:25,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 24 [2024-11-07 10:16:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:25,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:25,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997217545] [2024-11-07 10:16:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997217545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:25,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:16:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394129993] [2024-11-07 10:16:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:25,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:16:25,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:16:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:16:25,170 INFO L87 Difference]: Start difference. First operand 339 states and 462 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:26,560 INFO L93 Difference]: Finished difference Result 610 states and 830 transitions. [2024-11-07 10:16:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:16:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2024-11-07 10:16:26,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:26,564 INFO L225 Difference]: With dead ends: 610 [2024-11-07 10:16:26,564 INFO L226 Difference]: Without dead ends: 345 [2024-11-07 10:16:26,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:16:26,566 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 84 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:26,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 523 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:16:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-07 10:16:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 285. [2024-11-07 10:16:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 243 states have (on average 1.308641975308642) internal successors, (318), 244 states have internal predecessors, (318), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:16:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 386 transitions. [2024-11-07 10:16:26,590 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 386 transitions. Word has length 107 [2024-11-07 10:16:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:26,591 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 386 transitions. [2024-11-07 10:16:26,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 386 transitions. [2024-11-07 10:16:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:16:26,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:26,593 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:26,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-07 10:16:26,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:26,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:26,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash -682797284, now seen corresponding path program 1 times [2024-11-07 10:16:26,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:26,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808031335] [2024-11-07 10:16:26,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:26,795 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:16:26,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:26,797 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:16:26,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 10:16:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:27,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 10:16:27,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:27,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:16:27,274 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 19 treesize of output 19 [2024-11-07 10:16:27,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:27,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2024-11-07 10:16:27,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:27,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 32 [2024-11-07 10:16:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:27,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:27,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:27,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808031335] [2024-11-07 10:16:27,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808031335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:27,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:27,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:16:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278745742] [2024-11-07 10:16:27,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:16:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:16:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:16:27,626 INFO L87 Difference]: Start difference. First operand 285 states and 386 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:28,735 INFO L93 Difference]: Finished difference Result 293 states and 393 transitions. [2024-11-07 10:16:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:16:28,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-07 10:16:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:28,737 INFO L225 Difference]: With dead ends: 293 [2024-11-07 10:16:28,737 INFO L226 Difference]: Without dead ends: 291 [2024-11-07 10:16:28,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:16:28,738 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 86 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:28,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1019 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 10:16:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-07 10:16:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2024-11-07 10:16:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 246 states have (on average 1.3048780487804879) internal successors, (321), 247 states have internal predecessors, (321), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:16:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 389 transitions. [2024-11-07 10:16:28,757 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 389 transitions. Word has length 109 [2024-11-07 10:16:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:28,758 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 389 transitions. [2024-11-07 10:16:28,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 389 transitions. [2024-11-07 10:16:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:16:28,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:28,759 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:28,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 10:16:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:28,960 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash -680950242, now seen corresponding path program 1 times [2024-11-07 10:16:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135784488] [2024-11-07 10:16:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:28,961 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:16:28,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:28,963 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:16:28,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 10:16:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:29,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 10:16:29,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:29,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:16:30,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-07 10:16:30,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2024-11-07 10:16:34,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:34,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 86 [2024-11-07 10:16:34,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 107 [2024-11-07 10:16:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-07 10:16:34,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:34,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:34,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135784488] [2024-11-07 10:16:34,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135784488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:34,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:34,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:16:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396902310] [2024-11-07 10:16:34,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:34,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:16:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:34,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:16:34,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:16:34,605 INFO L87 Difference]: Start difference. First operand 288 states and 389 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:37,123 INFO L93 Difference]: Finished difference Result 768 states and 1034 transitions. [2024-11-07 10:16:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:16:37,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-07 10:16:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:37,134 INFO L225 Difference]: With dead ends: 768 [2024-11-07 10:16:37,134 INFO L226 Difference]: Without dead ends: 554 [2024-11-07 10:16:37,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:16:37,135 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 250 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:37,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 714 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 10:16:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-07 10:16:37,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 550. [2024-11-07 10:16:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 467 states have (on average 1.297644539614561) internal successors, (606), 471 states have internal predecessors, (606), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 10:16:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 738 transitions. [2024-11-07 10:16:37,179 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 738 transitions. Word has length 109 [2024-11-07 10:16:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:37,179 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 738 transitions. [2024-11-07 10:16:37,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 738 transitions. [2024-11-07 10:16:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:16:37,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:37,181 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:37,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-07 10:16:37,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:37,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:37,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1094057120, now seen corresponding path program 1 times [2024-11-07 10:16:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:37,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175640675] [2024-11-07 10:16:37,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:37,384 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:16:37,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:37,386 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:16:37,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 10:16:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:37,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:16:37,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:37,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:16:38,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 65 [2024-11-07 10:16:38,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:38,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 77 [2024-11-07 10:16:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-07 10:16:38,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:16:38,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175640675] [2024-11-07 10:16:38,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175640675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:16:38,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1604951187] [2024-11-07 10:16:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:38,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:16:38,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:16:38,706 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:16:38,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-07 10:16:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:39,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 10:16:39,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:39,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:16:40,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-07 10:16:40,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:40,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 77 [2024-11-07 10:16:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-07 10:16:40,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:16:40,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1604951187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:16:40,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:16:40,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-07 10:16:40,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874967250] [2024-11-07 10:16:40,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:16:40,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:16:40,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:16:40,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:16:40,971 INFO L87 Difference]: Start difference. First operand 550 states and 738 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-07 10:16:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:42,021 INFO L93 Difference]: Finished difference Result 972 states and 1304 transitions. [2024-11-07 10:16:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:16:42,022 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 109 [2024-11-07 10:16:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:42,028 INFO L225 Difference]: With dead ends: 972 [2024-11-07 10:16:42,028 INFO L226 Difference]: Without dead ends: 554 [2024-11-07 10:16:42,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:16:42,030 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 457 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:42,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 959 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:16:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-07 10:16:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 550. [2024-11-07 10:16:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 467 states have (on average 1.2933618843683083) internal successors, (604), 471 states have internal predecessors, (604), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 10:16:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 736 transitions. [2024-11-07 10:16:42,078 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 736 transitions. Word has length 109 [2024-11-07 10:16:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:42,078 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 736 transitions. [2024-11-07 10:16:42,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 15 states have internal predecessors, (102), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-07 10:16:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 736 transitions. [2024-11-07 10:16:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:16:42,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:42,080 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:42,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-07 10:16:42,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-07 10:16:42,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:42,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:42,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1774115490, now seen corresponding path program 1 times [2024-11-07 10:16:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:42,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948131995] [2024-11-07 10:16:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:42,482 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:16:42,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:42,485 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:16:42,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-07 10:16:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:42,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:16:42,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:42,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-07 10:16:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:42,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:42,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948131995] [2024-11-07 10:16:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948131995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:42,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:42,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:16:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876893346] [2024-11-07 10:16:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:42,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:16:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:16:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:16:42,836 INFO L87 Difference]: Start difference. First operand 550 states and 736 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:43,534 INFO L93 Difference]: Finished difference Result 1272 states and 1682 transitions. [2024-11-07 10:16:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:16:43,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-07 10:16:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:43,541 INFO L225 Difference]: With dead ends: 1272 [2024-11-07 10:16:43,541 INFO L226 Difference]: Without dead ends: 854 [2024-11-07 10:16:43,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:16:43,543 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 69 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:43,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 693 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:16:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-07 10:16:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 650. [2024-11-07 10:16:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 567 states have (on average 1.2945326278659612) internal successors, (734), 571 states have internal predecessors, (734), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 10:16:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 866 transitions. [2024-11-07 10:16:43,612 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 866 transitions. Word has length 109 [2024-11-07 10:16:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:43,612 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 866 transitions. [2024-11-07 10:16:43,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 866 transitions. [2024-11-07 10:16:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:16:43,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:43,615 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:43,629 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 (16)] Ended with exit code 0 [2024-11-07 10:16:43,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:43,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:43,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1513575147, now seen corresponding path program 1 times [2024-11-07 10:16:43,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:43,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113051529] [2024-11-07 10:16:43,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:43,817 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:16:43,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:43,819 INFO L229 MonitoredProcess]: Starting monitored process 17 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:16:43,820 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 (17)] Waiting until timeout for monitored process [2024-11-07 10:16:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:44,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:16:44,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-07 10:16:44,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:16:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:16:44,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:44,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113051529] [2024-11-07 10:16:44,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113051529] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:16:44,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:16:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-11-07 10:16:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744710907] [2024-11-07 10:16:44,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:44,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:16:44,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:16:44,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:16:44,454 INFO L87 Difference]: Start difference. First operand 650 states and 866 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:44,600 INFO L93 Difference]: Finished difference Result 1356 states and 1794 transitions. [2024-11-07 10:16:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:16:44,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2024-11-07 10:16:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:44,608 INFO L225 Difference]: With dead ends: 1356 [2024-11-07 10:16:44,609 INFO L226 Difference]: Without dead ends: 846 [2024-11-07 10:16:44,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:16:44,612 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 86 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:44,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 325 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:16:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2024-11-07 10:16:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 730. [2024-11-07 10:16:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 647 states have (on average 1.285935085007728) internal successors, (832), 651 states have internal predecessors, (832), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 10:16:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 964 transitions. [2024-11-07 10:16:44,662 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 964 transitions. Word has length 109 [2024-11-07 10:16:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:44,662 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 964 transitions. [2024-11-07 10:16:44,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:16:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 964 transitions. [2024-11-07 10:16:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:16:44,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:44,664 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:44,675 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 (17)] Ended with exit code 0 [2024-11-07 10:16:44,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:16:44,865 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:44,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 140192796, now seen corresponding path program 1 times [2024-11-07 10:16:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:44,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448325503] [2024-11-07 10:16:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:44,866 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:16:44,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:44,870 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:16:44,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-07 10:16:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:45,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:16:45,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:45,249 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:16:45,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-07 10:16:45,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:45,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 32 [2024-11-07 10:16:45,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:16:45,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 28 [2024-11-07 10:16:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-07 10:16:45,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:45,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:45,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448325503] [2024-11-07 10:16:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448325503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:45,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:45,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:16:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193639639] [2024-11-07 10:16:45,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:45,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:16:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:16:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:16:45,509 INFO L87 Difference]: Start difference. First operand 730 states and 964 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:46,885 INFO L93 Difference]: Finished difference Result 1628 states and 2154 transitions. [2024-11-07 10:16:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:16:46,886 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-07 10:16:46,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:46,890 INFO L225 Difference]: With dead ends: 1628 [2024-11-07 10:16:46,890 INFO L226 Difference]: Without dead ends: 1046 [2024-11-07 10:16:46,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:16:46,892 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 207 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:46,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1024 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:16:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-07 10:16:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 950. [2024-11-07 10:16:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 867 states have (on average 1.301038062283737) internal successors, (1128), 871 states have internal predecessors, (1128), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 10:16:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1260 transitions. [2024-11-07 10:16:46,952 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1260 transitions. Word has length 109 [2024-11-07 10:16:46,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:46,952 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1260 transitions. [2024-11-07 10:16:46,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1260 transitions. [2024-11-07 10:16:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:16:46,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:46,955 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:46,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-07 10:16:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:47,155 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:47,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:47,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1139670882, now seen corresponding path program 1 times [2024-11-07 10:16:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399161919] [2024-11-07 10:16:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:47,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:47,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:47,158 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:16:47,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-07 10:16:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:47,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:16:47,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:47,517 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:16:47,596 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 40 treesize of output 20 [2024-11-07 10:16:47,605 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 40 treesize of output 20 [2024-11-07 10:16:47,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-07 10:16:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-07 10:16:47,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:47,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:47,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399161919] [2024-11-07 10:16:47,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399161919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:47,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:47,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:16:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396038647] [2024-11-07 10:16:47,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:47,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:16:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:47,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:16:47,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:16:47,660 INFO L87 Difference]: Start difference. First operand 950 states and 1260 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:16:48,571 INFO L93 Difference]: Finished difference Result 1802 states and 2380 transitions. [2024-11-07 10:16:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:16:48,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-07 10:16:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:16:48,576 INFO L225 Difference]: With dead ends: 1802 [2024-11-07 10:16:48,576 INFO L226 Difference]: Without dead ends: 1030 [2024-11-07 10:16:48,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:16:48,578 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 215 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:16:48,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 431 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:16:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-11-07 10:16:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 934. [2024-11-07 10:16:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 849 states have (on average 1.2932862190812722) internal successors, (1098), 853 states have internal predecessors, (1098), 66 states have call successors, (66), 18 states have call predecessors, (66), 18 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 10:16:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1230 transitions. [2024-11-07 10:16:48,648 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1230 transitions. Word has length 109 [2024-11-07 10:16:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:16:48,648 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1230 transitions. [2024-11-07 10:16:48,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1230 transitions. [2024-11-07 10:16:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-07 10:16:48,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:16:48,650 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:16:48,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-07 10:16:48,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:16:48,851 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:16:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:16:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 280741406, now seen corresponding path program 1 times [2024-11-07 10:16:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:16:48,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817943044] [2024-11-07 10:16:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:16:48,853 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:16:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:16:48,855 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:16:48,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-07 10:16:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:16:49,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:16:49,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:16:49,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-07 10:16:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-07 10:16:49,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:16:49,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:16:49,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817943044] [2024-11-07 10:16:49,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817943044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:16:49,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:16:49,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:16:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177932148] [2024-11-07 10:16:49,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:16:49,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:16:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:16:49,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:16:49,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:16:49,335 INFO L87 Difference]: Start difference. First operand 934 states and 1230 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:16:52,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:16:54,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:16:57,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:16:59,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:17:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:17:00,563 INFO L93 Difference]: Finished difference Result 1452 states and 1905 transitions. [2024-11-07 10:17:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:17:00,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-11-07 10:17:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:17:00,568 INFO L225 Difference]: With dead ends: 1452 [2024-11-07 10:17:00,568 INFO L226 Difference]: Without dead ends: 674 [2024-11-07 10:17:00,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:17:00,570 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 98 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:17:00,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 364 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 222 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2024-11-07 10:17:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-07 10:17:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2024-11-07 10:17:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 592 states have (on average 1.2736486486486487) internal successors, (754), 593 states have internal predecessors, (754), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 10:17:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 846 transitions. [2024-11-07 10:17:00,615 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 846 transitions. Word has length 109 [2024-11-07 10:17:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:17:00,615 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 846 transitions. [2024-11-07 10:17:00,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:17:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 846 transitions. [2024-11-07 10:17:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 10:17:00,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:17:00,617 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:17:00,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-07 10:17:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:17:00,818 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:17:00,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:17:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1680493512, now seen corresponding path program 1 times [2024-11-07 10:17:00,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:17:00,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384519501] [2024-11-07 10:17:00,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:17:00,822 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:17:00,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:17:00,824 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:17:00,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-07 10:17:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:17:01,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 10:17:01,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:17:01,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:17:01,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:17:01,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:17:01,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:17:01,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-07 10:17:01,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2024-11-07 10:17:02,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2024-11-07 10:17:03,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-07 10:17:03,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-07 10:17:03,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:17:03,653 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 50 treesize of output 24 [2024-11-07 10:17:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-07 10:17:04,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:17:04,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:17:04,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384519501] [2024-11-07 10:17:04,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384519501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:17:04,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:17:04,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:17:04,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532427608] [2024-11-07 10:17:04,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:17:04,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:17:04,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:17:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:17:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:17:04,177 INFO L87 Difference]: Start difference. First operand 654 states and 846 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)