./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-51.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-p_file-51.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', 'f7c31be9a434ba53341a3b1b9d3c3008143e1c2024ae18072fc17ca52fd542b8'] 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-p_file-51.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 f7c31be9a434ba53341a3b1b9d3c3008143e1c2024ae18072fc17ca52fd542b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:35:27,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:35:27,127 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:35:27,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:35:27,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:35:27,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:35:27,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:35:27,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:35:27,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:35:27,145 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:35:27,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:35:27,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:35:27,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:35:27,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:35:27,146 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:35:27,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:35:27,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:35:27,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:35:27,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:35:27,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:35:27,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:35:27,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:35:27,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:35:27,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:35:27,149 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 -> f7c31be9a434ba53341a3b1b9d3c3008143e1c2024ae18072fc17ca52fd542b8 [2024-11-07 10:35:27,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:35:27,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:35:27,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:35:27,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:35:27,363 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:35:27,364 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-p_file-51.i [2024-11-07 10:35:28,555 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:35:28,799 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:35:28,800 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-51.i [2024-11-07 10:35:28,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6809fe7a6/bf5a15b87fd34e56a3595e0b5cb1741f/FLAG23b821e78 [2024-11-07 10:35:29,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6809fe7a6/bf5a15b87fd34e56a3595e0b5cb1741f [2024-11-07 10:35:29,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:35:29,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:35:29,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:35:29,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:35:29,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:35:29,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309a2ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29, skipping insertion in model container [2024-11-07 10:35:29,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:35:29,234 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-p_file-51.i[916,929] [2024-11-07 10:35:29,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:35:29,273 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:35:29,282 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-p_file-51.i[916,929] [2024-11-07 10:35:29,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:35:29,323 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:35:29,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29 WrapperNode [2024-11-07 10:35:29,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:35:29,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:35:29,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:35:29,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:35:29,330 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:35:29" (1/1) ... [2024-11-07 10:35:29,340 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:35:29" (1/1) ... [2024-11-07 10:35:29,378 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 588 [2024-11-07 10:35:29,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:35:29,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:35:29,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:35:29,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:35:29,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,423 INFO L175 MemorySlicer]: Split 145 memory accesses to 15 slices as follows [2, 7, 8, 7, 12, 8, 12, 10, 17, 10, 12, 8, 12, 14, 6]. 12 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2]. [2024-11-07 10:35:29,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:35:29,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:35:29,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:35:29,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:35:29,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (1/1) ... [2024-11-07 10:35:29,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:35:29,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:35:29,490 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:35:29,497 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:35:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:35:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:35:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:35:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:35:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:35:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:35:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:35:29,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:35:29,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:35:29,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:35:29,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-07 10:35:29,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-07 10:35:29,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:35:29,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-07 10:35:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:35:29,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:35:29,675 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:35:29,677 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:35:30,203 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-07 10:35:30,203 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:35:30,216 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:35:30,216 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:35:30,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:35:30 BoogieIcfgContainer [2024-11-07 10:35:30,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:35:30,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:35:30,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:35:30,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:35:30,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:35:29" (1/3) ... [2024-11-07 10:35:30,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387671f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:35:30, skipping insertion in model container [2024-11-07 10:35:30,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:29" (2/3) ... [2024-11-07 10:35:30,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387671f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:35:30, skipping insertion in model container [2024-11-07 10:35:30,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:35:30" (3/3) ... [2024-11-07 10:35:30,225 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-51.i [2024-11-07 10:35:30,235 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:35:30,236 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:35:30,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:35:30,297 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;@22b5b035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:35:30,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:35:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:35:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:35:30,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:30,313 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:30,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:30,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash 782488780, now seen corresponding path program 1 times [2024-11-07 10:35:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:35:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571975517] [2024-11-07 10:35:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:35:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:35:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:35:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:35:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:35:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:35:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:35:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:35:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:35:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:35:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:35:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:35:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:35:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:35:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:35:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:35:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:35:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:35:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:35:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:35:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:35:30,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:35:30,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571975517] [2024-11-07 10:35:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571975517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:35:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:35:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:35:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056001953] [2024-11-07 10:35:30,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:35:30,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:35:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:35:30,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:35:30,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:35:30,707 INFO L87 Difference]: Start difference. First operand has 124 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:35:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:30,731 INFO L93 Difference]: Finished difference Result 241 states and 379 transitions. [2024-11-07 10:35:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:35:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-07 10:35:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:30,739 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:35:30,739 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:35:30,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:35:30,743 INFO L432 NwaCegarLoop]: 176 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, 176 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:35:30,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:35:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:35:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:35:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:35:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-07 10:35:30,774 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2024-11-07 10:35:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:30,774 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-07 10:35:30,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:35:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-07 10:35:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:35:30,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:30,777 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:30,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:35:30,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:30,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash 695419246, now seen corresponding path program 1 times [2024-11-07 10:35:30,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:35:30,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924012495] [2024-11-07 10:35:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:35:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:35:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:35:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:35:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:35:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:35:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:35:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:35:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:35:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:35:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:35:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:35:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:35:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:35:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:35:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:35:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:35:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 10:35:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 10:35:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 10:35:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:35:31,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:35:31,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924012495] [2024-11-07 10:35:31,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924012495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:35:31,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:35:31,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:35:31,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880813328] [2024-11-07 10:35:31,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:35:31,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:35:31,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:35:31,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:35:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:35:31,317 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:35:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:31,343 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2024-11-07 10:35:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:35:31,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-07 10:35:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:31,347 INFO L225 Difference]: With dead ends: 237 [2024-11-07 10:35:31,347 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:35:31,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:35:31,348 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:35:31,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:35:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:35:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:35:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:35:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 175 transitions. [2024-11-07 10:35:31,367 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 175 transitions. Word has length 149 [2024-11-07 10:35:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:31,368 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 175 transitions. [2024-11-07 10:35:31,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:35:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 175 transitions. [2024-11-07 10:35:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:35:31,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:31,372 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:31,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:35:31,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash 142154623, now seen corresponding path program 1 times [2024-11-07 10:35:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:35:31,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818544171] [2024-11-07 10:35:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:35:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:35:31,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:35:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:35:31,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:35:31,790 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:35:31,791 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:35:31,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:35:31,794 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 10:35:32,038 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:35:32,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:35:32 BoogieIcfgContainer [2024-11-07 10:35:32,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:35:32,051 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:35:32,051 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:35:32,051 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:35:32,052 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:35:30" (3/4) ... [2024-11-07 10:35:32,054 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:35:32,055 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:35:32,060 INFO L158 Benchmark]: Toolchain (without parser) took 2924.76ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 83.7MB in the beginning and 49.9MB in the end (delta: 33.7MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2024-11-07 10:35:32,060 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:35:32,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.83ms. Allocated memory is still 109.1MB. Free memory was 83.5MB in the beginning and 69.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:35:32,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.14ms. Allocated memory is still 109.1MB. Free memory was 69.2MB in the beginning and 66.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:35:32,061 INFO L158 Benchmark]: Boogie Preprocessor took 69.63ms. Allocated memory is still 109.1MB. Free memory was 66.1MB in the beginning and 61.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:35:32,063 INFO L158 Benchmark]: RCFGBuilder took 764.71ms. Allocated memory is still 109.1MB. Free memory was 61.3MB in the beginning and 63.4MB in the end (delta: -2.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-07 10:35:32,063 INFO L158 Benchmark]: TraceAbstraction took 1831.83ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 62.9MB in the beginning and 50.0MB in the end (delta: 13.0MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2024-11-07 10:35:32,064 INFO L158 Benchmark]: Witness Printer took 8.38ms. Allocated memory is still 142.6MB. Free memory was 50.0MB in the beginning and 49.9MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:35:32,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.83ms. Allocated memory is still 109.1MB. Free memory was 83.5MB in the beginning and 69.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.14ms. Allocated memory is still 109.1MB. Free memory was 69.2MB in the beginning and 66.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.63ms. Allocated memory is still 109.1MB. Free memory was 66.1MB in the beginning and 61.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 764.71ms. Allocated memory is still 109.1MB. Free memory was 61.3MB in the beginning and 63.4MB in the end (delta: -2.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1831.83ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 62.9MB in the beginning and 50.0MB in the end (delta: 13.0MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * Witness Printer took 8.38ms. Allocated memory is still 142.6MB. Free memory was 50.0MB in the beginning and 49.9MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L22] double var_1_1 = 10.8; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] signed short int var_1_5 = -16; [L26] signed short int var_1_5 = -16; [L27] signed short int* var_1_5_Pointer = &(var_1_5); [L28] double var_1_6 = 100.01; [L28] double var_1_6 = 100.01; [L29] double* var_1_6_Pointer = &(var_1_6); [L30] double var_1_7 = 999999999.4; [L30] double var_1_7 = 999999999.4; [L31] double* var_1_7_Pointer = &(var_1_7); [L32] double var_1_8 = 10.6; [L32] double var_1_8 = 10.6; [L33] double* var_1_8_Pointer = &(var_1_8); [L34] double var_1_9 = 127.5; [L34] double var_1_9 = 127.5; [L35] double* var_1_9_Pointer = &(var_1_9); [L36] unsigned long int var_1_10 = 1; [L36] unsigned long int var_1_10 = 1; [L37] unsigned long int* var_1_10_Pointer = &(var_1_10); [L38] unsigned long int var_1_11 = 2467894503; [L38] unsigned long int var_1_11 = 2467894503; [L39] unsigned long int* var_1_11_Pointer = &(var_1_11); [L40] unsigned long int var_1_12 = 2565572511; [L40] unsigned long int var_1_12 = 2565572511; [L41] unsigned long int* var_1_12_Pointer = &(var_1_12); [L42] unsigned long int var_1_13 = 500; [L42] unsigned long int var_1_13 = 500; [L43] unsigned long int* var_1_13_Pointer = &(var_1_13); [L44] unsigned long int var_1_15 = 2277019112; [L44] unsigned long int var_1_15 = 2277019112; [L45] unsigned long int* var_1_15_Pointer = &(var_1_15); [L46] unsigned long int var_1_16 = 2745650083; [L46] unsigned long int var_1_16 = 2745650083; [L47] unsigned long int* var_1_16_Pointer = &(var_1_16); [L48] unsigned long int var_1_17 = 8; [L48] unsigned long int var_1_17 = 8; [L49] unsigned long int* var_1_17_Pointer = &(var_1_17); [L50] unsigned long int last_1_var_1_17 = 8; VAL [isInitial=0, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L113] EXPR \read(var_1_17) [L113] last_1_var_1_17 = var_1_17 [L123] RET updateLastVariables() [L124] CALL updateVariables() [L81] var_1_2 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L82] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L83] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] var_1_5 = __VERIFIER_nondet_short() [L85] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] var_1_6 = __VERIFIER_nondet_double() [L89] EXPR \read(var_1_6) [L89] EXPR var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F [L89] EXPR \read(var_1_6) [L89] EXPR var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR (var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] EXPR (var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] var_1_7 = __VERIFIER_nondet_double() [L91] EXPR \read(var_1_7) [L91] EXPR var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F [L91] EXPR \read(var_1_7) [L91] EXPR var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR (var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR (var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_8 = __VERIFIER_nondet_double() [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] EXPR var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] EXPR (var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] EXPR (var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] var_1_9 = __VERIFIER_nondet_double() [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] var_1_11 = __VERIFIER_nondet_ulong() [L97] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_11 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_11 <= 4294967295) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] var_1_12 = __VERIFIER_nondet_ulong() [L100] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] CALL assume_abort_if_not(var_1_12 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] RET assume_abort_if_not(var_1_12 <= 4294967295) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] var_1_13 = __VERIFIER_nondet_ulong() [L103] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] var_1_15 = __VERIFIER_nondet_ulong() [L106] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] var_1_16 = __VERIFIER_nondet_ulong() [L109] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] CALL assume_abort_if_not(var_1_16 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] RET assume_abort_if_not(var_1_16 >= 2147483647) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L124] RET updateVariables() [L125] CALL step() [L54] unsigned long int stepLocal_1 = - last_1_var_1_17; [L55] EXPR \read(*var_1_11_Pointer) [L55] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_12_Pointer))) [L55] EXPR \read(*var_1_11_Pointer) [L55] EXPR (((*(var_1_11_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_12_Pointer))) VAL [isInitial=1, last_1_var_1_17=8, stepLocal_1=-8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] COND FALSE !(((((((*(var_1_11_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))) != stepLocal_1) [L58] EXPR \read(*var_1_15_Pointer) [L58] (*(var_1_10_Pointer)) = (*(var_1_15_Pointer)) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L60] COND TRUE (*(var_1_10_Pointer)) <= (*(var_1_10_Pointer)) [L61] EXPR \read(*var_1_2_Pointer) [L61] (*(var_1_2_Pointer)) && ((*(var_1_10_Pointer)) == (((((*(var_1_16_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_12_Pointer)))))) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L61] (*(var_1_2_Pointer)) && ((*(var_1_10_Pointer)) == (((((*(var_1_16_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_12_Pointer)))))) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L61] COND FALSE !((*(var_1_2_Pointer)) && ((*(var_1_10_Pointer)) == (((((*(var_1_16_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_12_Pointer))))))) [L69] EXPR \read(*var_1_10_Pointer) [L69] unsigned long int stepLocal_0 = (*(var_1_10_Pointer)); [L70] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L70] COND FALSE !((*(var_1_2_Pointer))) [L77] EXPR \read(*var_1_8_Pointer) [L77] (*(var_1_1_Pointer)) = (*(var_1_8_Pointer)) [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR (*(var_1_2_Pointer)) ? (((*(var_1_10_Pointer)) >= ((*(var_1_10_Pointer)) / (*(var_1_5_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_7_Pointer)) + (((((*(var_1_8_Pointer))) > (((*(var_1_9_Pointer)) + 63.25))) ? ((*(var_1_8_Pointer))) : (((*(var_1_9_Pointer)) + 63.25)))))))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) [L116] EXPR \read(*var_1_1_Pointer) [L116] EXPR \read(*var_1_8_Pointer) [L116] EXPR (*(var_1_2_Pointer)) ? (((*(var_1_10_Pointer)) >= ((*(var_1_10_Pointer)) / (*(var_1_5_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_7_Pointer)) + (((((*(var_1_8_Pointer))) > (((*(var_1_9_Pointer)) + 63.25))) ? ((*(var_1_8_Pointer))) : (((*(var_1_9_Pointer)) + 63.25)))))))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR ((*(var_1_2_Pointer)) ? (((*(var_1_10_Pointer)) >= ((*(var_1_10_Pointer)) / (*(var_1_5_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_7_Pointer)) + (((((*(var_1_8_Pointer))) > (((*(var_1_9_Pointer)) + 63.25))) ? ((*(var_1_8_Pointer))) : (((*(var_1_9_Pointer)) + 63.25)))))))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer))))) && ((((((((*(var_1_11_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))) != (- last_1_var_1_17)) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_10_Pointer)) == ((unsigned long int) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR ((*(var_1_2_Pointer)) ? (((*(var_1_10_Pointer)) >= ((*(var_1_10_Pointer)) / (*(var_1_5_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_7_Pointer)) + (((((*(var_1_8_Pointer))) > (((*(var_1_9_Pointer)) + 63.25))) ? ((*(var_1_8_Pointer))) : (((*(var_1_9_Pointer)) + 63.25)))))))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer))))) && ((((((((*(var_1_11_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))) != (- last_1_var_1_17)) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_10_Pointer)) == ((unsigned long int) (*(var_1_15_Pointer))))) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR (((*(var_1_2_Pointer)) ? (((*(var_1_10_Pointer)) >= ((*(var_1_10_Pointer)) / (*(var_1_5_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_7_Pointer)) + (((((*(var_1_8_Pointer))) > (((*(var_1_9_Pointer)) + 63.25))) ? ((*(var_1_8_Pointer))) : (((*(var_1_9_Pointer)) + 63.25)))))))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer))))) && ((((((((*(var_1_11_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))) != (- last_1_var_1_17)) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_10_Pointer)) == ((unsigned long int) (*(var_1_15_Pointer)))))) && (((*(var_1_10_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_10_Pointer)) == (((((*(var_1_16_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_12_Pointer))))))) ? (((*(var_1_10_Pointer)) < (*(var_1_11_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (*(var_1_15_Pointer)))) : 1) : 1) : ((*(var_1_17_Pointer)) == ((unsigned long int) (*(var_1_16_Pointer))))) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116] EXPR (((*(var_1_2_Pointer)) ? (((*(var_1_10_Pointer)) >= ((*(var_1_10_Pointer)) / (*(var_1_5_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_7_Pointer)) + (((((*(var_1_8_Pointer))) > (((*(var_1_9_Pointer)) + 63.25))) ? ((*(var_1_8_Pointer))) : (((*(var_1_9_Pointer)) + 63.25)))))))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer))))) && ((((((((*(var_1_11_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))) != (- last_1_var_1_17)) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_10_Pointer)) == ((unsigned long int) (*(var_1_15_Pointer)))))) && (((*(var_1_10_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_10_Pointer)) == (((((*(var_1_16_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_12_Pointer))))))) ? (((*(var_1_10_Pointer)) < (*(var_1_11_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (*(var_1_15_Pointer)))) : 1) : 1) : ((*(var_1_17_Pointer)) == ((unsigned long int) (*(var_1_16_Pointer))))) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L116-L117] return (((*(var_1_2_Pointer)) ? (((*(var_1_10_Pointer)) >= ((*(var_1_10_Pointer)) / (*(var_1_5_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_6_Pointer))) < 0 ) ? -((*(var_1_6_Pointer))) : ((*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((double) ((*(var_1_7_Pointer)) + (((((*(var_1_8_Pointer))) > (((*(var_1_9_Pointer)) + 63.25))) ? ((*(var_1_8_Pointer))) : (((*(var_1_9_Pointer)) + 63.25)))))))) : ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer))))) && ((((((((*(var_1_11_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_12_Pointer))))) - (*(var_1_13_Pointer))) != (- last_1_var_1_17)) ? ((*(var_1_10_Pointer)) == ((unsigned long int) ((((((*(var_1_15_Pointer))) < ((*(var_1_16_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_16_Pointer))))) - (*(var_1_13_Pointer))))) : ((*(var_1_10_Pointer)) == ((unsigned long int) (*(var_1_15_Pointer)))))) && (((*(var_1_10_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_10_Pointer)) == (((((*(var_1_16_Pointer))) > ((*(var_1_12_Pointer)))) ? ((*(var_1_16_Pointer))) : ((*(var_1_12_Pointer))))))) ? (((*(var_1_10_Pointer)) < (*(var_1_11_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (*(var_1_15_Pointer)))) : 1) : 1) : ((*(var_1_17_Pointer)) == ((unsigned long int) (*(var_1_16_Pointer))))) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=8, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_11={12:0}, var_1_11_Pointer={12:0}, var_1_12={13:0}, var_1_12_Pointer={13:0}, var_1_13={14:0}, var_1_13_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4 IncrementalHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 350 mSDtfsCounter, 4 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 449 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:35:32,119 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-p_file-51.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 f7c31be9a434ba53341a3b1b9d3c3008143e1c2024ae18072fc17ca52fd542b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:35:34,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:35:34,605 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:35:34,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:35:34,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:35:34,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:35:34,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:35:34,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:35:34,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:35:34,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:35:34,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:35:34,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:35:34,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:35:34,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:35:34,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:35:34,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:35:34,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:35:34,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:35:34,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:35:34,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:35:34,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:35:34,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:35:34,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:35:34,657 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:35:34,657 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:35:34,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:35:34,657 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:35:34,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:35:34,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:35:34,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:35:34,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:35:34,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:35:34,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:35:34,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:35:34,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:35:34,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:35:34,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:35:34,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:35:34,659 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:35:34,659 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:35:34,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:35:34,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:35:34,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:35:34,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:35:34,659 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 -> f7c31be9a434ba53341a3b1b9d3c3008143e1c2024ae18072fc17ca52fd542b8 [2024-11-07 10:35:34,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:35:34,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:35:34,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:35:34,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:35:34,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:35:34,942 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-p_file-51.i [2024-11-07 10:35:36,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:35:36,440 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:35:36,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-51.i [2024-11-07 10:35:36,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e62061ed/189699569b4142a3979e4bf393758838/FLAGd0bd1ffd3 [2024-11-07 10:35:36,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e62061ed/189699569b4142a3979e4bf393758838 [2024-11-07 10:35:36,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:35:36,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:35:36,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:35:36,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:35:36,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:35:36,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54547c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36, skipping insertion in model container [2024-11-07 10:35:36,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:35:36,607 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-p_file-51.i[916,929] [2024-11-07 10:35:36,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:35:36,674 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:35:36,682 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-p_file-51.i[916,929] [2024-11-07 10:35:36,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:35:36,736 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:35:36,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36 WrapperNode [2024-11-07 10:35:36,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:35:36,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:35:36,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:35:36,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:35:36,745 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:35:36" (1/1) ... [2024-11-07 10:35:36,762 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:35:36" (1/1) ... [2024-11-07 10:35:36,795 INFO L138 Inliner]: procedures = 36, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 587 [2024-11-07 10:35:36,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:35:36,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:35:36,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:35:36,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:35:36,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,857 INFO L175 MemorySlicer]: Split 145 memory accesses to 15 slices as follows [2, 7, 8, 7, 12, 8, 12, 10, 17, 10, 12, 8, 12, 14, 6]. 12 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2]. [2024-11-07 10:35:36,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:35:36,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:35:36,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:35:36,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:35:36,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (1/1) ... [2024-11-07 10:35:36,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:35:36,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:35:36,938 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:35:36,947 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:35:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:35:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:35:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:35:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-07 10:35:36,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-07 10:35:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-07 10:35:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-07 10:35:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-07 10:35:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-07 10:35:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-07 10:35:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-07 10:35:36,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-07 10:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-07 10:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-07 10:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-07 10:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-07 10:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-07 10:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-07 10:35:36,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-07 10:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-07 10:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-07 10:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-07 10:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-07 10:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-07 10:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-07 10:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-07 10:35:36,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-07 10:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-07 10:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-07 10:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:35:36,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:35:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-07 10:35:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-07 10:35:36,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2024-11-07 10:35:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:35:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:35:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:35:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-07 10:35:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-07 10:35:36,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-07 10:35:36,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2024-11-07 10:35:36,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2024-11-07 10:35:37,209 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:35:37,211 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:35:38,921 INFO L? ?]: Removed 151 outVars from TransFormulas that were not future-live. [2024-11-07 10:35:38,923 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:35:38,930 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:35:38,930 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:35:38,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:35:38 BoogieIcfgContainer [2024-11-07 10:35:38,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:35:38,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:35:38,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:35:38,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:35:38,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:35:36" (1/3) ... [2024-11-07 10:35:38,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534ad93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:35:38, skipping insertion in model container [2024-11-07 10:35:38,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:35:36" (2/3) ... [2024-11-07 10:35:38,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534ad93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:35:38, skipping insertion in model container [2024-11-07 10:35:38,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:35:38" (3/3) ... [2024-11-07 10:35:38,938 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-51.i [2024-11-07 10:35:38,947 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:35:38,948 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:35:38,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:35:38,999 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;@79e309b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:35:38,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:35:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:35:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:35:39,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:39,010 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:39,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:39,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash 782488780, now seen corresponding path program 1 times [2024-11-07 10:35:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:35:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783867312] [2024-11-07 10:35:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:39,034 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:35:39,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:35:39,036 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:35:39,038 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:35:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:39,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:35:39,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:35:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-07 10:35:39,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:35:39,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:35:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783867312] [2024-11-07 10:35:39,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783867312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:35:39,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:35:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:35:39,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036891526] [2024-11-07 10:35:39,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:35:39,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:35:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:35:39,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:35:39,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:35:39,495 INFO L87 Difference]: Start difference. First operand has 124 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:35:39,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:39,516 INFO L93 Difference]: Finished difference Result 241 states and 379 transitions. [2024-11-07 10:35:39,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:35:39,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-11-07 10:35:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:39,523 INFO L225 Difference]: With dead ends: 241 [2024-11-07 10:35:39,523 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:35:39,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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:35:39,527 INFO L432 NwaCegarLoop]: 176 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, 176 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:35:39,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:35:39,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:35:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:35:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:35:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-07 10:35:39,569 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2024-11-07 10:35:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:39,570 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-07 10:35:39,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:35:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-07 10:35:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 10:35:39,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:39,575 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:39,595 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:35:39,775 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:35:39,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:39,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash 695419246, now seen corresponding path program 1 times [2024-11-07 10:35:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:35:39,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683771337] [2024-11-07 10:35:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:39,780 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:35:39,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:35:39,782 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:35:39,784 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:35:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:40,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:35:40,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:35:41,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-07 10:35:41,143 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:35:41,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-07 10:35:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 3 proven. 249 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-07 10:35:41,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:35:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:35:41,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:35:41,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683771337] [2024-11-07 10:35:41,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683771337] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:35:41,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:35:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-07 10:35:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771566095] [2024-11-07 10:35:41,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:35:41,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:35:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:35:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:35:41,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:35:41,321 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:35:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:41,353 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2024-11-07 10:35:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:35:41,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-11-07 10:35:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:41,358 INFO L225 Difference]: With dead ends: 237 [2024-11-07 10:35:41,358 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 10:35:41,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:35:41,359 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:35:41,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:35:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 10:35:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-07 10:35:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 10:35:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 175 transitions. [2024-11-07 10:35:41,373 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 175 transitions. Word has length 149 [2024-11-07 10:35:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:41,378 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 175 transitions. [2024-11-07 10:35:41,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:35:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 175 transitions. [2024-11-07 10:35:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:35:41,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:41,379 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:41,392 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:35:41,580 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:35:41,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:41,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:41,581 INFO L85 PathProgramCache]: Analyzing trace with hash 142154623, now seen corresponding path program 1 times [2024-11-07 10:35:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:35:41,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977790082] [2024-11-07 10:35:41,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:41,583 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:35:41,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:35:41,585 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:35:41,587 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:35:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:42,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 10:35:42,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:35:43,705 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:35:43,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:35:43,857 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 203 treesize of output 133 [2024-11-07 10:35:43,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:35:43,865 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 288 treesize of output 138 [2024-11-07 10:35:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-11-07 10:35:43,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:35:44,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:35:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977790082] [2024-11-07 10:35:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977790082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:35:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1627272848] [2024-11-07 10:35:44,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:35:44,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:35:44,285 INFO L229 MonitoredProcess]: Starting monitored process 5 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:35:44,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-07 10:35:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:45,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 10:35:45,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:35:47,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-07 10:35:50,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-07 10:35:50,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:35:50,449 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 177 treesize of output 121 [2024-11-07 10:35:50,454 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 0 case distinctions, treesize of input 274 treesize of output 146 [2024-11-07 10:35:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-11-07 10:35:50,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:35:50,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1627272848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:35:50,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:35:50,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-07 10:35:50,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931417752] [2024-11-07 10:35:50,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:35:50,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:35:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:35:50,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:35:50,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:35:50,641 INFO L87 Difference]: Start difference. First operand 120 states and 175 transitions. Second operand has 16 states, 16 states have (on average 7.25) internal successors, (116), 15 states have internal predecessors, (116), 4 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-07 10:35:59,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:36:01,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:36:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:04,455 INFO L93 Difference]: Finished difference Result 416 states and 606 transitions. [2024-11-07 10:36:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:36:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.25) internal successors, (116), 15 states have internal predecessors, (116), 4 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 151 [2024-11-07 10:36:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:04,462 INFO L225 Difference]: With dead ends: 416 [2024-11-07 10:36:04,463 INFO L226 Difference]: Without dead ends: 299 [2024-11-07 10:36:04,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2024-11-07 10:36:04,464 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 798 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:04,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1621 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-11-07 10:36:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-07 10:36:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 293. [2024-11-07 10:36:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.389344262295082) internal successors, (339), 246 states have internal predecessors, (339), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 10:36:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 429 transitions. [2024-11-07 10:36:04,511 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 429 transitions. Word has length 151 [2024-11-07 10:36:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:04,511 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 429 transitions. [2024-11-07 10:36:04,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.25) internal successors, (116), 15 states have internal predecessors, (116), 4 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-11-07 10:36:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 429 transitions. [2024-11-07 10:36:04,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 10:36:04,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:04,519 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:04,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:36:04,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-07 10:36:04,924 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,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 10:36:04,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:04,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:04,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1764248643, now seen corresponding path program 1 times [2024-11-07 10:36:04,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:04,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557002886] [2024-11-07 10:36:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:04,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:36:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:04,932 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:36:04,940 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:36:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:05,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:36:05,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2024-11-07 10:36:05,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:36:05,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:05,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557002886] [2024-11-07 10:36:05,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557002886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:36:05,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:36:05,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:36:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643144009] [2024-11-07 10:36:05,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:05,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:36:05,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:05,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:36:05,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:36:05,278 INFO L87 Difference]: Start difference. First operand 293 states and 429 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:36:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:05,377 INFO L93 Difference]: Finished difference Result 583 states and 855 transitions. [2024-11-07 10:36:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:36:05,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2024-11-07 10:36:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:05,381 INFO L225 Difference]: With dead ends: 583 [2024-11-07 10:36:05,381 INFO L226 Difference]: Without dead ends: 293 [2024-11-07 10:36:05,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 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:36:05,384 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:05,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:36:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-07 10:36:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-07 10:36:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.3852459016393444) internal successors, (338), 246 states have internal predecessors, (338), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 10:36:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 428 transitions. [2024-11-07 10:36:05,415 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 428 transitions. Word has length 151 [2024-11-07 10:36:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:05,416 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 428 transitions. [2024-11-07 10:36:05,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 10:36:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 428 transitions. [2024-11-07 10:36:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:36:05,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:05,418 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:05,429 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 (6)] Forceful destruction successful, exit code 0 [2024-11-07 10:36:05,618 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:36:05,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:05,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash -567240519, now seen corresponding path program 1 times [2024-11-07 10:36:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:05,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452427747] [2024-11-07 10:36:05,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:05,620 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:36:05,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:05,626 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:36:05,627 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:36:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:06,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 10:36:06,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:07,459 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:36:07,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:36:07,674 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 203 treesize of output 133 [2024-11-07 10:36:07,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:36:07,686 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 286 treesize of output 136 [2024-11-07 10:36:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 11 proven. 369 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-07 10:36:07,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:08,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452427747] [2024-11-07 10:36:08,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452427747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:08,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1739068982] [2024-11-07 10:36:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:08,067 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:36:08,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:36:08,073 INFO L229 MonitoredProcess]: Starting monitored process 8 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:36:08,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 10:36:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:09,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 10:36:09,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:10,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-07 10:36:16,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-07 10:36:16,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:36:16,620 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 177 treesize of output 121 [2024-11-07 10:36:16,624 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 0 case distinctions, treesize of input 264 treesize of output 140 [2024-11-07 10:36:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 11 proven. 369 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-07 10:36:16,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:16,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1739068982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:16,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:36:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-11-07 10:36:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252358624] [2024-11-07 10:36:16,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:36:16,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 10:36:16,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:16,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 10:36:16,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=546, Unknown=1, NotChecked=0, Total=650 [2024-11-07 10:36:16,828 INFO L87 Difference]: Start difference. First operand 293 states and 428 transitions. Second operand has 23 states, 21 states have (on average 6.0) internal successors, (126), 20 states have internal predecessors, (126), 6 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-07 10:36:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:29,497 INFO L93 Difference]: Finished difference Result 769 states and 1117 transitions. [2024-11-07 10:36:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 10:36:29,498 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.0) internal successors, (126), 20 states have internal predecessors, (126), 6 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) Word has length 153 [2024-11-07 10:36:29,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:29,502 INFO L225 Difference]: With dead ends: 769 [2024-11-07 10:36:29,503 INFO L226 Difference]: Without dead ends: 479 [2024-11-07 10:36:29,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 321 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=348, Invalid=1373, Unknown=1, NotChecked=0, Total=1722 [2024-11-07 10:36:29,504 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 822 mSDsluCounter, 2296 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2564 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:29,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2564 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-07 10:36:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-07 10:36:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 407. [2024-11-07 10:36:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 337 states have (on average 1.3827893175074184) internal successors, (466), 340 states have internal predecessors, (466), 64 states have call successors, (64), 5 states have call predecessors, (64), 5 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 10:36:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2024-11-07 10:36:29,545 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 153 [2024-11-07 10:36:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:29,546 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2024-11-07 10:36:29,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.0) internal successors, (126), 20 states have internal predecessors, (126), 6 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-07 10:36:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2024-11-07 10:36:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-07 10:36:29,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:29,547 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:29,566 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:36:29,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-07 10:36:29,948 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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 10:36:29,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:29,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1033830587, now seen corresponding path program 1 times [2024-11-07 10:36:29,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:29,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001011132] [2024-11-07 10:36:29,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:29,950 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:36:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:29,952 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:36:29,953 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:36:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:30,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:36:30,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-11-07 10:36:30,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:36:30,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:30,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001011132] [2024-11-07 10:36:30,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001011132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:36:30,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:36:30,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:36:30,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087093156] [2024-11-07 10:36:30,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:30,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:36:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:30,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:36:30,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:36:30,270 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 10:36:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:30,461 INFO L93 Difference]: Finished difference Result 713 states and 1034 transitions. [2024-11-07 10:36:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:36:30,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-07 10:36:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:30,464 INFO L225 Difference]: With dead ends: 713 [2024-11-07 10:36:30,465 INFO L226 Difference]: Without dead ends: 303 [2024-11-07 10:36:30,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:36:30,466 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:30,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 720 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:36:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-07 10:36:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2024-11-07 10:36:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 247 states have (on average 1.3765182186234817) internal successors, (340), 249 states have internal predecessors, (340), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 10:36:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 430 transitions. [2024-11-07 10:36:30,490 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 430 transitions. Word has length 153 [2024-11-07 10:36:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:30,490 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 430 transitions. [2024-11-07 10:36:30,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 10:36:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 430 transitions. [2024-11-07 10:36:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 10:36:30,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:30,492 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:30,501 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 (9)] Forceful destruction successful, exit code 0 [2024-11-07 10:36:30,692 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:36:30,693 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:30,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash -342912468, now seen corresponding path program 1 times [2024-11-07 10:36:30,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:30,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683300942] [2024-11-07 10:36:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:30,695 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:36:30,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:30,696 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:36:30,698 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:36:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:31,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:36:31,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:36:31,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:31,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:31,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683300942] [2024-11-07 10:36:31,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683300942] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:31,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:36:31,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-07 10:36:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498367934] [2024-11-07 10:36:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:31,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:36:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:36:31,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:36:31,683 INFO L87 Difference]: Start difference. First operand 297 states and 430 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:31,760 INFO L93 Difference]: Finished difference Result 638 states and 924 transitions. [2024-11-07 10:36:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:36:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-11-07 10:36:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:31,762 INFO L225 Difference]: With dead ends: 638 [2024-11-07 10:36:31,762 INFO L226 Difference]: Without dead ends: 344 [2024-11-07 10:36:31,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:36:31,763 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 55 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:31,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 654 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:36:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-07 10:36:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 301. [2024-11-07 10:36:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 251 states have (on average 1.3784860557768925) internal successors, (346), 253 states have internal predecessors, (346), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 10:36:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 436 transitions. [2024-11-07 10:36:31,780 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 436 transitions. Word has length 154 [2024-11-07 10:36:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:31,780 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 436 transitions. [2024-11-07 10:36:31,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:31,780 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 436 transitions. [2024-11-07 10:36:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:36:31,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:31,781 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:31,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 10:36:31,982 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:36:31,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:31,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1571661738, now seen corresponding path program 1 times [2024-11-07 10:36:31,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:31,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631008362] [2024-11-07 10:36:31,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:31,983 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:36:31,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:31,986 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:36:31,987 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:36:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:32,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:36:32,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:36:32,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:32,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:32,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631008362] [2024-11-07 10:36:32,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631008362] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:32,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:36:32,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-07 10:36:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310185641] [2024-11-07 10:36:32,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:32,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:36:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:32,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:36:32,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:36:32,929 INFO L87 Difference]: Start difference. First operand 301 states and 436 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:33,017 INFO L93 Difference]: Finished difference Result 630 states and 910 transitions. [2024-11-07 10:36:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:36:33,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-07 10:36:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:33,019 INFO L225 Difference]: With dead ends: 630 [2024-11-07 10:36:33,020 INFO L226 Difference]: Without dead ends: 332 [2024-11-07 10:36:33,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:36:33,020 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 84 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:33,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 490 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:36:33,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-07 10:36:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 303. [2024-11-07 10:36:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 253 states have (on average 1.3754940711462451) internal successors, (348), 255 states have internal predecessors, (348), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 10:36:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 438 transitions. [2024-11-07 10:36:33,041 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 438 transitions. Word has length 155 [2024-11-07 10:36:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:33,041 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 438 transitions. [2024-11-07 10:36:33,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 438 transitions. [2024-11-07 10:36:33,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 10:36:33,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:33,044 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:33,056 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:36:33,245 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:36:33,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:33,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash 777338606, now seen corresponding path program 1 times [2024-11-07 10:36:33,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:33,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [695378994] [2024-11-07 10:36:33,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:33,246 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:36:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:33,250 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:36:33,250 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:36:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:33,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:36:33,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:33,604 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 11 [2024-11-07 10:36:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:33,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:36:33,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:33,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [695378994] [2024-11-07 10:36:33,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [695378994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:36:33,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:36:33,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:36:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500000320] [2024-11-07 10:36:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:33,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:36:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:33,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:36:33,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:36:33,697 INFO L87 Difference]: Start difference. First operand 303 states and 438 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:33,959 INFO L93 Difference]: Finished difference Result 884 states and 1278 transitions. [2024-11-07 10:36:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:36:33,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-11-07 10:36:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:33,963 INFO L225 Difference]: With dead ends: 884 [2024-11-07 10:36:33,963 INFO L226 Difference]: Without dead ends: 584 [2024-11-07 10:36:33,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:36:33,965 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 140 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:33,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1090 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:36:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-07 10:36:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 580. [2024-11-07 10:36:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 489 states have (on average 1.3762781186094069) internal successors, (673), 495 states have internal predecessors, (673), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 76 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-07 10:36:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 837 transitions. [2024-11-07 10:36:33,997 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 837 transitions. Word has length 155 [2024-11-07 10:36:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:33,997 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 837 transitions. [2024-11-07 10:36:33,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 837 transitions. [2024-11-07 10:36:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 10:36:33,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:33,998 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:34,011 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:36:34,199 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:36:34,200 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:34,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash -772529657, now seen corresponding path program 1 times [2024-11-07 10:36:34,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:34,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154823065] [2024-11-07 10:36:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:34,201 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:36:34,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:34,203 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:36:34,205 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:36:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:34,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:36:34,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:35,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:36:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:36:35,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:35,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:35,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154823065] [2024-11-07 10:36:35,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154823065] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:35,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:36:35,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-07 10:36:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287222185] [2024-11-07 10:36:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:35,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:36:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:36:35,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:36:35,217 INFO L87 Difference]: Start difference. First operand 580 states and 837 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:35,311 INFO L93 Difference]: Finished difference Result 1218 states and 1751 transitions. [2024-11-07 10:36:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:36:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-11-07 10:36:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:35,314 INFO L225 Difference]: With dead ends: 1218 [2024-11-07 10:36:35,314 INFO L226 Difference]: Without dead ends: 631 [2024-11-07 10:36:35,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:36:35,315 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 57 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:35,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 681 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:36:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-07 10:36:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 578. [2024-11-07 10:36:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 487 states have (on average 1.3572895277207393) internal successors, (661), 493 states have internal predecessors, (661), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 76 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-07 10:36:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 825 transitions. [2024-11-07 10:36:35,344 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 825 transitions. Word has length 156 [2024-11-07 10:36:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:35,344 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 825 transitions. [2024-11-07 10:36:35,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 825 transitions. [2024-11-07 10:36:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:36:35,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:35,345 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:35,360 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:36:35,546 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:36:35,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:35,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1930237324, now seen corresponding path program 1 times [2024-11-07 10:36:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:35,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376550404] [2024-11-07 10:36:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:35,548 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:36:35,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:35,551 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:36:35,552 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:36:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:36,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:36:36,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:36,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-07 10:36:36,558 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:36:36,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-07 10:36:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 3 proven. 249 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-07 10:36:36,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:36,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:36,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376550404] [2024-11-07 10:36:36,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376550404] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:36,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:36:36,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-07 10:36:36,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158186387] [2024-11-07 10:36:36,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:36,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:36:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:36:36,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:36:36,728 INFO L87 Difference]: Start difference. First operand 578 states and 825 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:36,777 INFO L93 Difference]: Finished difference Result 1153 states and 1647 transitions. [2024-11-07 10:36:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:36:36,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:36:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:36,782 INFO L225 Difference]: With dead ends: 1153 [2024-11-07 10:36:36,782 INFO L226 Difference]: Without dead ends: 578 [2024-11-07 10:36:36,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:36:36,783 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:36,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:36:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-07 10:36:36,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2024-11-07 10:36:36,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 487 states have (on average 1.3449691991786448) internal successors, (655), 493 states have internal predecessors, (655), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 76 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-07 10:36:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 819 transitions. [2024-11-07 10:36:36,813 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 819 transitions. Word has length 157 [2024-11-07 10:36:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:36,815 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 819 transitions. [2024-11-07 10:36:36,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 819 transitions. [2024-11-07 10:36:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:36:36,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:36,817 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:36,828 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:36:37,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:36:37,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:37,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1298280179, now seen corresponding path program 1 times [2024-11-07 10:36:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:37,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116680348] [2024-11-07 10:36:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:37,018 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:36:37,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:37,022 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:36:37,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-07 10:36:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:37,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:36:37,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:37,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-07 10:36:37,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 10:36:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:37,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:36:37,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116680348] [2024-11-07 10:36:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116680348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:36:37,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:36:37,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:36:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894584332] [2024-11-07 10:36:37,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:37,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:36:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:36:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:36:37,544 INFO L87 Difference]: Start difference. First operand 578 states and 819 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:37,847 INFO L93 Difference]: Finished difference Result 1305 states and 1846 transitions. [2024-11-07 10:36:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:36:37,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:36:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:37,855 INFO L225 Difference]: With dead ends: 1305 [2024-11-07 10:36:37,855 INFO L226 Difference]: Without dead ends: 730 [2024-11-07 10:36:37,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:36:37,856 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 63 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:37,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 782 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:36:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-07 10:36:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 656. [2024-11-07 10:36:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 565 states have (on average 1.3557522123893806) internal successors, (766), 571 states have internal predecessors, (766), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 76 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-07 10:36:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 930 transitions. [2024-11-07 10:36:37,887 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 930 transitions. Word has length 157 [2024-11-07 10:36:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:37,887 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 930 transitions. [2024-11-07 10:36:37,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 930 transitions. [2024-11-07 10:36:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:36:37,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:37,889 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:37,899 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 (15)] Forceful destruction successful, exit code 0 [2024-11-07 10:36:38,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:36:38,090 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:38,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1556445617, now seen corresponding path program 1 times [2024-11-07 10:36:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:38,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948535328] [2024-11-07 10:36:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:38,091 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:36:38,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:38,094 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:36:38,095 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:36:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:38,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 10:36:38,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:42,000 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 15 treesize of output 7 [2024-11-07 10:36:42,314 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 30 treesize of output 18 [2024-11-07 10:36:42,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:36:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 7 proven. 505 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 10:36:42,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:42,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948535328] [2024-11-07 10:36:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948535328] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:36:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 29 [2024-11-07 10:36:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022382749] [2024-11-07 10:36:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:42,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:36:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:36:42,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-07 10:36:42,953 INFO L87 Difference]: Start difference. First operand 656 states and 930 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:43,516 INFO L93 Difference]: Finished difference Result 1482 states and 2094 transitions. [2024-11-07 10:36:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:36:43,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:36:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:43,520 INFO L225 Difference]: With dead ends: 1482 [2024-11-07 10:36:43,520 INFO L226 Difference]: Without dead ends: 829 [2024-11-07 10:36:43,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2024-11-07 10:36:43,521 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 412 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:43,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 886 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:36:43,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-07 10:36:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 825. [2024-11-07 10:36:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 705 states have (on average 1.3432624113475178) internal successors, (947), 715 states have internal predecessors, (947), 107 states have call successors, (107), 12 states have call predecessors, (107), 12 states have return successors, (107), 97 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-07 10:36:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1161 transitions. [2024-11-07 10:36:43,560 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1161 transitions. Word has length 157 [2024-11-07 10:36:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:43,560 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1161 transitions. [2024-11-07 10:36:43,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1161 transitions. [2024-11-07 10:36:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:36:43,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:43,562 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:43,573 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 (16)] Forceful destruction successful, exit code 0 [2024-11-07 10:36:43,766 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:36:43,767 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:43,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:43,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2004892709, now seen corresponding path program 1 times [2024-11-07 10:36:43,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:43,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748879035] [2024-11-07 10:36:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:43,768 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:36:43,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:43,771 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:36:43,772 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:36:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:44,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:36:44,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:44,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:36:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:36:44,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:44,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:44,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748879035] [2024-11-07 10:36:44,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748879035] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:44,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:36:44,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-07 10:36:44,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783281277] [2024-11-07 10:36:44,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:44,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:36:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:44,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:36:44,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:36:44,706 INFO L87 Difference]: Start difference. First operand 825 states and 1161 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:44,825 INFO L93 Difference]: Finished difference Result 1619 states and 2277 transitions. [2024-11-07 10:36:44,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:36:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:36:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:44,829 INFO L225 Difference]: With dead ends: 1619 [2024-11-07 10:36:44,829 INFO L226 Difference]: Without dead ends: 797 [2024-11-07 10:36:44,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:36:44,830 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 121 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:44,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 538 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:36:44,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-11-07 10:36:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 793. [2024-11-07 10:36:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 673 states have (on average 1.3313521545319464) internal successors, (896), 683 states have internal predecessors, (896), 107 states have call successors, (107), 12 states have call predecessors, (107), 12 states have return successors, (107), 97 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-07 10:36:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1110 transitions. [2024-11-07 10:36:44,880 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1110 transitions. Word has length 157 [2024-11-07 10:36:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:44,880 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1110 transitions. [2024-11-07 10:36:44,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1110 transitions. [2024-11-07 10:36:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:36:44,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:44,882 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:44,897 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:36:45,083 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:36:45,083 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:45,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:45,083 INFO L85 PathProgramCache]: Analyzing trace with hash 901918505, now seen corresponding path program 1 times [2024-11-07 10:36:45,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853204195] [2024-11-07 10:36:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:45,085 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:36:45,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:45,087 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:36:45,089 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:36:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:45,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:36:45,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:45,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-07 10:36:45,675 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:36:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:45,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:36:45,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853204195] [2024-11-07 10:36:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853204195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:36:45,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:36:45,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:36:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015920803] [2024-11-07 10:36:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:45,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:36:45,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:45,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:36:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:36:45,703 INFO L87 Difference]: Start difference. First operand 793 states and 1110 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:46,096 INFO L93 Difference]: Finished difference Result 1716 states and 2403 transitions. [2024-11-07 10:36:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:36:46,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:36:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:46,101 INFO L225 Difference]: With dead ends: 1716 [2024-11-07 10:36:46,101 INFO L226 Difference]: Without dead ends: 926 [2024-11-07 10:36:46,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:36:46,102 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 66 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:46,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1211 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:36:46,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-07 10:36:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 861. [2024-11-07 10:36:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 741 states have (on average 1.3373819163292848) internal successors, (991), 751 states have internal predecessors, (991), 107 states have call successors, (107), 12 states have call predecessors, (107), 12 states have return successors, (107), 97 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-07 10:36:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1205 transitions. [2024-11-07 10:36:46,149 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1205 transitions. Word has length 157 [2024-11-07 10:36:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:46,150 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1205 transitions. [2024-11-07 10:36:46,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1205 transitions. [2024-11-07 10:36:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:36:46,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:46,151 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:46,161 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:36:46,352 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:36:46,352 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:46,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 508891495, now seen corresponding path program 1 times [2024-11-07 10:36:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249755058] [2024-11-07 10:36:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:46,354 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:36:46,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:46,359 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:36:46,371 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:36:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:46,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 10:36:46,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:50,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 10:36:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 7 proven. 505 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 10:36:50,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:51,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249755058] [2024-11-07 10:36:51,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249755058] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:51,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:36:51,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27 [2024-11-07 10:36:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119275712] [2024-11-07 10:36:51,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:51,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:36:51,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:51,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:36:51,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2024-11-07 10:36:51,261 INFO L87 Difference]: Start difference. First operand 861 states and 1205 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:51,909 INFO L93 Difference]: Finished difference Result 1830 states and 2559 transitions. [2024-11-07 10:36:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:36:51,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:36:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:51,915 INFO L225 Difference]: With dead ends: 1830 [2024-11-07 10:36:51,915 INFO L226 Difference]: Without dead ends: 972 [2024-11-07 10:36:51,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2024-11-07 10:36:51,917 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 88 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:51,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 968 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:36:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-11-07 10:36:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 861. [2024-11-07 10:36:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 741 states have (on average 1.3373819163292848) internal successors, (991), 751 states have internal predecessors, (991), 107 states have call successors, (107), 12 states have call predecessors, (107), 12 states have return successors, (107), 97 states have call predecessors, (107), 107 states have call successors, (107) [2024-11-07 10:36:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1205 transitions. [2024-11-07 10:36:51,977 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1205 transitions. Word has length 157 [2024-11-07 10:36:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:51,982 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1205 transitions. [2024-11-07 10:36:51,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1205 transitions. [2024-11-07 10:36:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:36:51,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:51,984 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:52,006 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:36:52,184 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:36:52,184 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:52,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1438828789, now seen corresponding path program 1 times [2024-11-07 10:36:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:52,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342240504] [2024-11-07 10:36:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:52,185 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:36:52,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:52,187 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:36:52,189 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:36:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:52,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 10:36:52,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:56,452 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 15 treesize of output 7 [2024-11-07 10:36:56,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:36:56,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:36:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 7 proven. 505 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 10:36:56,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:36:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:57,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:57,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342240504] [2024-11-07 10:36:57,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342240504] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:36:57,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:36:57,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [23] total 29 [2024-11-07 10:36:57,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650033218] [2024-11-07 10:36:57,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:57,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:36:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:57,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:36:57,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-07 10:36:57,628 INFO L87 Difference]: Start difference. First operand 861 states and 1205 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:58,333 INFO L93 Difference]: Finished difference Result 1794 states and 2501 transitions. [2024-11-07 10:36:58,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:36:58,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:36:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:58,338 INFO L225 Difference]: With dead ends: 1794 [2024-11-07 10:36:58,338 INFO L226 Difference]: Without dead ends: 936 [2024-11-07 10:36:58,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2024-11-07 10:36:58,340 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 228 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:58,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 868 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:36:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-11-07 10:36:58,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 763. [2024-11-07 10:36:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 656 states have (on average 1.3323170731707317) internal successors, (874), 664 states have internal predecessors, (874), 93 states have call successors, (93), 13 states have call predecessors, (93), 13 states have return successors, (93), 85 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-07 10:36:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1060 transitions. [2024-11-07 10:36:58,386 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1060 transitions. Word has length 157 [2024-11-07 10:36:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:58,387 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1060 transitions. [2024-11-07 10:36:58,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1060 transitions. [2024-11-07 10:36:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:36:58,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:58,388 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:58,414 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:36:58,588 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:36:58,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:58,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1696994227, now seen corresponding path program 1 times [2024-11-07 10:36:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:58,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296580215] [2024-11-07 10:36:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:58,589 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:36:58,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:58,592 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:36:58,592 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:36:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:36:58,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:36:58,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:36:59,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-07 10:36:59,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-07 10:36:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:36:59,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:36:59,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:36:59,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296580215] [2024-11-07 10:36:59,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296580215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:36:59,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:36:59,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:36:59,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628420947] [2024-11-07 10:36:59,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:36:59,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:36:59,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:36:59,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:36:59,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:36:59,068 INFO L87 Difference]: Start difference. First operand 763 states and 1060 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:36:59,396 INFO L93 Difference]: Finished difference Result 1508 states and 2092 transitions. [2024-11-07 10:36:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:36:59,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:36:59,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:36:59,401 INFO L225 Difference]: With dead ends: 1508 [2024-11-07 10:36:59,401 INFO L226 Difference]: Without dead ends: 809 [2024-11-07 10:36:59,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:36:59,403 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 56 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:36:59,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1222 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:36:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-07 10:36:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 746. [2024-11-07 10:36:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 639 states have (on average 1.3302034428794993) internal successors, (850), 647 states have internal predecessors, (850), 93 states have call successors, (93), 13 states have call predecessors, (93), 13 states have return successors, (93), 85 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-07 10:36:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1036 transitions. [2024-11-07 10:36:59,437 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1036 transitions. Word has length 157 [2024-11-07 10:36:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:36:59,437 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1036 transitions. [2024-11-07 10:36:59,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:36:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1036 transitions. [2024-11-07 10:36:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:36:59,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:36:59,439 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:36:59,449 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 (21)] Ended with exit code 0 [2024-11-07 10:36:59,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:36:59,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:36:59,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:36:59,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1042467115, now seen corresponding path program 1 times [2024-11-07 10:36:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:36:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652158684] [2024-11-07 10:36:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:36:59,644 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:36:59,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:36:59,646 INFO L229 MonitoredProcess]: Starting monitored process 22 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:36:59,653 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 (22)] Waiting until timeout for monitored process [2024-11-07 10:37:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:00,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 10:37:00,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:37:04,151 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:37:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 7 proven. 505 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-07 10:37:04,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:37:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:37:04,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:37:04,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652158684] [2024-11-07 10:37:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652158684] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:37:04,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:37:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27 [2024-11-07 10:37:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844101208] [2024-11-07 10:37:04,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:37:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:37:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:37:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:37:04,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2024-11-07 10:37:04,932 INFO L87 Difference]: Start difference. First operand 746 states and 1036 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:37:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:05,754 INFO L93 Difference]: Finished difference Result 1599 states and 2215 transitions. [2024-11-07 10:37:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:37:05,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:37:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:05,761 INFO L225 Difference]: With dead ends: 1599 [2024-11-07 10:37:05,761 INFO L226 Difference]: Without dead ends: 917 [2024-11-07 10:37:05,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2024-11-07 10:37:05,762 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 92 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:05,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1168 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:37:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-07 10:37:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 746. [2024-11-07 10:37:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 639 states have (on average 1.3302034428794993) internal successors, (850), 647 states have internal predecessors, (850), 93 states have call successors, (93), 13 states have call predecessors, (93), 13 states have return successors, (93), 85 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-07 10:37:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1036 transitions. [2024-11-07 10:37:05,802 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1036 transitions. Word has length 157 [2024-11-07 10:37:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:05,802 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1036 transitions. [2024-11-07 10:37:05,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:37:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1036 transitions. [2024-11-07 10:37:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 10:37:05,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:05,803 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:37:05,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-07 10:37:06,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:37:06,008 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:06,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash 649440105, now seen corresponding path program 1 times [2024-11-07 10:37:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:37:06,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298088416] [2024-11-07 10:37:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:06,009 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:37:06,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:37:06,011 INFO L229 MonitoredProcess]: Starting monitored process 23 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:37:06,013 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 (23)] Waiting until timeout for monitored process [2024-11-07 10:37:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:06,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 10:37:06,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:37:06,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-07 10:37:06,563 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:37:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:37:06,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:37:06,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:37:06,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298088416] [2024-11-07 10:37:06,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298088416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:37:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:37:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:37:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181543097] [2024-11-07 10:37:06,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:37:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:37:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:37:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:37:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:37:06,601 INFO L87 Difference]: Start difference. First operand 746 states and 1036 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:37:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:07,149 INFO L93 Difference]: Finished difference Result 1493 states and 2071 transitions. [2024-11-07 10:37:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:37:07,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2024-11-07 10:37:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:07,154 INFO L225 Difference]: With dead ends: 1493 [2024-11-07 10:37:07,154 INFO L226 Difference]: Without dead ends: 811 [2024-11-07 10:37:07,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:37:07,160 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 63 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:07,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1239 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:37:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-07 10:37:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 678. [2024-11-07 10:37:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 571 states have (on average 1.316987740805604) internal successors, (752), 579 states have internal predecessors, (752), 93 states have call successors, (93), 13 states have call predecessors, (93), 13 states have return successors, (93), 85 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-07 10:37:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 938 transitions. [2024-11-07 10:37:07,234 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 938 transitions. Word has length 157 [2024-11-07 10:37:07,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:07,234 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 938 transitions. [2024-11-07 10:37:07,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:37:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 938 transitions. [2024-11-07 10:37:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 10:37:07,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:07,236 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:37:07,246 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 (23)] Ended with exit code 0 [2024-11-07 10:37:07,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:37:07,436 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:37:07,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:37:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash 760478830, now seen corresponding path program 1 times [2024-11-07 10:37:07,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:37:07,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589083692] [2024-11-07 10:37:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:37:07,437 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:37:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:37:07,441 INFO L229 MonitoredProcess]: Starting monitored process 24 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:37:07,442 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 (24)] Waiting until timeout for monitored process [2024-11-07 10:37:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:37:07,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:37:07,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:37:07,816 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 22 treesize of output 18 [2024-11-07 10:37:07,912 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 26 treesize of output 18 [2024-11-07 10:37:07,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-11-07 10:37:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 10:37:08,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:37:08,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:37:08,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589083692] [2024-11-07 10:37:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589083692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:37:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:37:08,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:37:08,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823254157] [2024-11-07 10:37:08,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:37:08,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:37:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:37:08,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:37:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:37:08,040 INFO L87 Difference]: Start difference. First operand 678 states and 938 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:37:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:37:09,085 INFO L93 Difference]: Finished difference Result 1559 states and 2160 transitions. [2024-11-07 10:37:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:37:09,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 159 [2024-11-07 10:37:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:37:09,090 INFO L225 Difference]: With dead ends: 1559 [2024-11-07 10:37:09,090 INFO L226 Difference]: Without dead ends: 945 [2024-11-07 10:37:09,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:37:09,092 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 135 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:37:09,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1997 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:37:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-07 10:37:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 941. [2024-11-07 10:37:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 797 states have (on average 1.3174404015056462) internal successors, (1050), 809 states have internal predecessors, (1050), 126 states have call successors, (126), 17 states have call predecessors, (126), 17 states have return successors, (126), 114 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-07 10:37:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1302 transitions. [2024-11-07 10:37:09,146 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1302 transitions. Word has length 159 [2024-11-07 10:37:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:37:09,146 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1302 transitions. [2024-11-07 10:37:09,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 10:37:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1302 transitions. [2024-11-07 10:37:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 10:37:09,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:37:09,147 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:37:09,161 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 (24)] Forceful destruction successful, exit code 0